<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article article-type="research-article" dtd-version="2.3" xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Phys.</journal-id>
<journal-title>Frontiers in Physics</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Phys.</abbrev-journal-title>
<issn pub-type="epub">2296-424X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">602075</article-id>
<article-id pub-id-type="doi">10.3389/fphy.2020.602075</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Physics</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>The Connectedness of the Coronavirus Disease Pandemic in the World: A Study Based on Complex Network Analysis</article-title>
<alt-title alt-title-type="left-running-head">Zhu et al.</alt-title>
<alt-title alt-title-type="right-running-head">Connectedness of Coronavirus Disease Pandemic</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname>Zhu</surname>
<given-names>Sha</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<uri xlink:href="http://loop.frontiersin.org/people/1022227/overview"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Kou</surname>
<given-names>Meng</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Lai</surname>
<given-names>Fujun</given-names>
</name>
<xref ref-type="aff" rid="aff3">
<sup>3</sup>
</xref>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1190362/overview"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Feng</surname>
<given-names>Qingxiang</given-names>
</name>
<xref ref-type="aff" rid="aff4">
<sup>4</sup>
</xref>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<uri xlink:href="http://loop.frontiersin.org/people/1146610/overview"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Du</surname>
<given-names>Guorong</given-names>
</name>
<xref ref-type="aff" rid="aff5">
<sup>5</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1189132/overview"/>
</contrib>
</contrib-group>
<aff id="aff1">
<label>
<sup>1</sup>
</label>School of Statistics and Mathematics, Yunnan University of Finance and Economics, <addr-line>Kunming</addr-line>, <country>China</country>
</aff>
<aff id="aff2">
<label>
<sup>2</sup>
</label>School of Aerospace Engineering,Beijing Institute of Astronautical System Engineering, <addr-line>Beijing</addr-line>, <country>China</country>
</aff>
<aff id="aff3">
<label>
<sup>3</sup>
</label>School of Finance, Yunnan University of Finance and Economics, <addr-line>Kunming</addr-line>, <country>China</country>
</aff>
<aff id="aff4">
<label>
<sup>4</sup>
</label>Institute of Guangdong Hong Kong and Macao Development Studies, Sun Yat-sen University, <addr-line>Guangzhou</addr-line>, <country>China</country>
</aff>
<aff id="aff5">
<label>
<sup>5</sup>
</label>Chinese Academy of Finance and Development,Central University of Finance and Economics, <addr-line>Beijing</addr-line>, <country>China</country>
</aff>
<author-notes>
<fn fn-type="edited-by">
<p>
<bold>Edited by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/797979/overview">Hui-Jia Li</ext-link>, Beijing University of Posts and Telecommunications (BUPT), China</p>
</fn>
<fn fn-type="edited-by">
<p>
<bold>Reviewed by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/817896/overview">Ju Xiang</ext-link>, Changsha Medical University, China</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/101109">Chengyi Xia</ext-link>, Tianjin University of Technology, China</p>
</fn>
<corresp id="c001">&#x2a;Correspondence: Fujun Lai, <email>lfjlfj999@163.com</email>; Qingxiang Feng, <email>fengqx8@mail.sysu.edu.cn</email>
</corresp>
<fn fn-type="other">
<p>This article was submitted to Social Physics, a section of the journal Frontiers in Physics</p>
</fn>
</author-notes>
<pub-date pub-type="epub">
<day>25</day>
<month>01</month>
<year>2021</year>
</pub-date>
<pub-date pub-type="collection">
<year>2020</year>
</pub-date>
<volume>8</volume>
<elocation-id>602075</elocation-id>
<history>
<date date-type="received">
<day>02</day>
<month>09</month>
<year>2020</year>
</date>
<date date-type="accepted">
<day>07</day>
<month>12</month>
<year>2020</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2021 Zhu, Kou, Lai, Feng and Du.</copyright-statement>
<copyright-year>2021</copyright-year>
<copyright-holder>Zhu, Kou, Lai, Feng and Du</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the <ext-link ext-link-type="uri" xlink:href="http://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution License (CC BY)</ext-link>. The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="602075.pdf"/>
<abstract>
<p>Since the coronavirus disease (COVID-19) pandemic started at the beginning of 2020, it has seriously affected various countries&#x2019; economic and social development and accelerated the economic recession worldwide. Therefore, the connectedness of the global COVID-19 network across countries is studied in this article. Based on COVID-19 correlations in 122 countries, we construct a complex network of COVID-19 from January 19, 2020, to August 15, 2020. We then deconstruct the overall global network connectedness and analyze the connectedness characteristics. Moreover, we empirically investigate the network connectedness influencing factors by using various countries&#x2019; macroeconomic and social data. We find that the global COVID-19 pandemic network has some prominent complex network properties, such as low path length, high clustering, and good community structure. Furthermore, population density, economic size, trade, government spending, and quality of medical treatment are significant macrofactors affecting COVID-19 connectedness in different countries.</p>
</abstract>
<kwd-group>
<kwd>COVID-19</kwd>
<kwd>pandemic</kwd>
<kwd>connectedness</kwd>
<kwd>complex network</kwd>
<kwd>economic and social factors</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<title>Introduction</title>
<p>The COVID-19 global pandemic has changed the world remarkably. In just a few months, from limited local transmission in several countries, COVID-19 evolved into a multicountry spread and raged in more than 100 countries and regions across five continents. The COVID-19 pandemic has disrupted and changed the lifestyle of millions of people around the world and has had a profound impact on international relations and the economy. At present, increasing attention is being paid to the prevention and control of the COVID-19 pandemic. The pandemic is well under control in some countries, such as China and Germany, but most countries, including the United States, still do not have effective ways to control COVID-19. The fight against the COVID-19 pandemic has become a top priority for governments in many countries and regions, and the public health sector has paid unprecedented attention to protecting people&#x2019;s lives.</p>
<p>The rapid spread of the COVID-19 pandemic is more than just a medical problem. It is also linked to an infection network among countries worldwide. The complex network science of infectious diseases can reveal necessary information about disease transmission behavior, as many studies have shown. First, the research has revealed the typical characteristics of disease transmission behavior, such as the critical transmission threshold. The virus can spread in the network only when the transmission probability is more significant than a specific value called the propagation threshold of the network (Moore and Newman [<xref ref-type="bibr" rid="B1">1</xref>]). Moreover, nonrandom networks, such as small-world and community structure networks, are critical to disease transmission. Many real networks have small-world characteristics in that they tend to have small average distances and large clustering coefficients. In such a network, diseases more easily infect others. In addition, scholars [<xref ref-type="bibr" rid="B2">2</xref>] have found that a complex network with a community structure can promote or effectively inhibit the spread of diseases.</p>
<p>Furthermore, the key nodes in a network have a profound impact on disease transmission. Outbreaks of infectious diseases often spread rapidly from a small number of nodes to the entire network. Scientists propose indicators such as page rank, node degree, and k-shell to evaluate the network science characteristic [<xref ref-type="bibr" rid="B3">3</xref>]. In disease research, the information of these key nodes can reveal the path of disease transmission. Finally, network science information can be formulated to control the spread of diseases and reduce harmful transmission processes. In recent research, Wang et al. [<xref ref-type="bibr" rid="B4">4</xref>] use a two-layer network model method to find that people who received positive prevention information had a lower risk of disease infection than those who received negative prevention information.</p>
<p>Therefore, this study establishes a complex network of COVID-19 infections worldwide and investigates the influencing factors of the pandemic&#x2019;s connectedness across countries. We integrate three methods, i.e., complex networks, visualization principles, and regression models, to examine the global infection path of the COVID-19 pandemic and explore possible causes for the rapid COVID-19 spread. First, we calculate the correlation of COVID-19 infection growth rates between each pair of countries and obtain a global correlation matrix for COVID-19 infections using the sample from January 19, 2020, to August 15, 2020. Second, we establish a global infection complex network using a global correlation matrix to outline global COVID-19 pandemic relations and study the global infection complex network properties. Third, based on the properties of our complex network, we further investigate how economic and social factors (such as economic size, population density, international trade, government expenditure, inflation, and medical level) affect the network connectedness of the global COVID-19 infection complex network, shedding light on the prevention and control of the COVID-19 pandemic for policymakers.</p>
<p>The main conclusions are as follows. First, the complex network of the global COVID-19 pandemic has some prominent complex network properties, such as small-world network and community structure characteristics. In our network, there are a total of 958 edges in 122 countries around the world. The average path length between any two countries is approximately 3, the clustering coefficient is 0.58, and the network can be divided into several modularity classes. Second, in terms of intercountry connectedness, we further examine important topological characteristics in our network, e.g., degree, triangles, centrality, modularity class, hub, and authority. We use visual figures to demonstrate these features. The deeper the color is, the greater the connectedness in the visual figure is. This suggests that our network reflects the actual situation of the COVID-19 pandemic. Moreover, based on similarity, we divide the complex network into ten modularity classes. On the one hand, the community classification shows that the United States, Russia, and Colombia, which are suffering severely from the COVID-19 pandemic, are in one community, and China and Japan, which have better epidemic control, are in another community. On the other hand, the community classification is closely related to each country&#x2019;s geographical location. Finally, the analysis of influencing factors reveals that countries with considerable economic size, high population density, and high government expenditure have a higher network connectedness value. In contrast, countries with adequate import capacity and better medical levels can reduce the connectedness. In short, these empirical results can clearly explain the reasons for the rapid global spread of the COVID-19 pandemic.</p>
<p>The contributions of this study are as follows. First, the global COVID-19 pandemic network is constructed based on the number of infected people, and the topological information and connectedness characteristics of the network are obtained, to some extent explaining the spread of the COVID-19 pandemic from the perspective of a complex network. The global COVID-19 pandemic network is a complex network with the characteristics of short average distance and large clustering coefficient and has a good community structure division. Second, integrating the visualization method into the global COVID-19 pandemic network provides visual results of network connectedness, helping us determine the potentially dangerous countries. Finally, we identify economic and social factors affecting COVID-19 network connectedness, including population density, GDP, exports, government spending, and life expectancy. To reduce network connectedness, the government should implement measures to reduce population density, increase medical equipment imports, improve the medical treatment level, and effectively allocate government expenditures.</p>
</sec>
<sec id="s2">
<title>Literature Review</title>
<p>Vespignani, a professor who is famous for modeling the global spread of epidemics, proposes that there are inherent limitations to predictions in complex sociotechnical systems. However, mathematical and computational models have successfully forecast the size of epidemics and have been used to communicate the risks of uncurbed infectious disease outbreaks in recent years [<xref ref-type="bibr" rid="B5">5</xref>]. Since the beginning of the COVID-19 outbreak, many mathematical models have been proposed to describe the pandemic&#x2019;s spread. Some of them forecast the future dynamics of COVID-19. Perc et al. [<xref ref-type="bibr" rid="B6">6</xref>] forecast COVID-19 by using a simple iteration method that needs only the daily values of confirmed cases as input. Other researchers focus on diagnosing the spread of COVID-19 and analyzing the factors of disease transmission. Liu et al. [<xref ref-type="bibr" rid="B7">7</xref>] propose a susceptible-asymptomatic-infected-removed (SAIR) model on social networks to describe the spread of COVID-19 and analyze the outbreak based on epidemic data from Wuhan. Kraemer et al. [<xref ref-type="bibr" rid="B8">8</xref>] show that China&#x2019;s drastic control measures substantially mitigated the spread of COVID-19. Tsiotas and Magafas [<xref ref-type="bibr" rid="B9">9</xref>] build on the visibility graph algorithm to study the Greek COVID-19 infection curve as a complex network. These studies consider the spread of COVID-19 to be complicated, and diagnosing the scale and characteristics of the COVID-19 pandemic is conducive to governments effectively blocking the spread of this epidemic in their nations. Hence, we believe that it is very effective and important to prevent and control the further spread of COVID-19 by studying the connectedness characteristics of the pandemic complex network.</p>
<p>Studying the connectedness characteristics in a complex network through theoretical analysis and numerical simulation is helpful in understanding the microscopic mechanism of the spread process of an epidemic to discover practical ways to control the spread. Previous research has shown that a real social network is a typical complex network with small-world, scale-free, and high clustering characteristics. Small-world characteristics accelerate the spread of an epidemic, scale-free features facilitate the spread of an epidemic, and high clustering characteristics cause community clustering in epidemic transmission [<xref ref-type="bibr" rid="B5">5</xref>, <xref ref-type="bibr" rid="B10">10</xref>
<xref ref-type="bibr" rid="B11 B12 B13 B14 B15 B16">&#x2013;</xref>
<xref ref-type="bibr" rid="B17">17</xref>].</p>
<p>Hence, some scholars have combined complex network theory with epidemiology. Ni [<xref ref-type="bibr" rid="B18">18</xref>] builds a dynamic model of an epidemic and shows that infectious diseases spread much faster in public networks than in in-home networks. In the beginning, the number of infected people in the network increases exponentially, and the spread speed obviously increases with increasing local structural scale. Chen et al. [<xref ref-type="bibr" rid="B19">19</xref>] simulate the propagation of the H1N1 virus based on complex networks. The simulation results show that the targeted immunization strategy can effectively inhibit the spread of diseases. Wang et al. [<xref ref-type="bibr" rid="B3">3</xref>] deeply investigates influential spreaders&#x2019; identification in complex networks based on various centrality indices. Wang et al. [<xref ref-type="bibr" rid="B4">4</xref>] use a two-layer network model method to find that people who received positive prevention information had a lower risk of disease infection than those who received negative prevention information.</p>
<p>All the abovementioned studies try to provide feasible ways to curb the spread of the epidemic by using mathematical models or complex network tools. They can help us to work with limited data to solve problems in a constantly changing environment. However, at present, there are few studies that examine the global network of COVID-19. Therefore, determining the complicated connectedness of the COVID-19 complex network can fill gaps in the literature and effectively help the government identify good policies to prevent the COVID-19 pandemic in a timely manner. This study attempts to show the global situation of the COVID-19 pandemic based on a complex network. It profoundly analyzes the significant economic and social factors that affect the connectedness of the COVID-19 network to powerfully supplement the above literature.</p>
</sec>
<sec id="s3">
<title>Data</title>
<p>The growth rate of COVID-19-infected people in each country is calculated using the COVID-19 infection sample from January 19, 2020, to August 15, 2020. The data came from the CSMAR database. To analyze the influencing factors of global COVID-19 infection network connectedness, we use each country&#x2019;s economic and social macrodata in 2018 as samples. Economic and social variables include GDP, total exports, total imports, inflation rate, government expenses, population density, and life expectancy. All these data are from the World Bank database. From them, we take logarithms of GDP, total exports, total imports, government expenses, and population density to reduce the absolute values.</p>
</sec>
<sec sec-type="methods" id="s4">
<title>Methodology</title>
<sec id="s4-1">
<title>Construction of COVID-19 Pandemic Network</title>
<p>In this study, we build a COVID-19 infection complex network among 122 countries. Any node in our network is a specific country. Moreover, the possible connection between any two countries is called an edge in the network. These nodes and connected edges constitute the entire network of global COVID-19 infections. The network may rely more on certain countries, as many paths pass through them. Once this kind of country is identified and excluded, the network may collapse. Therefore, identifying these import infection nodes can enable governments to better fight the pandemic.</p>
<p>The key step in constructing the COVID-19 pandemic network is measuring the correlation of the growth rate of COVID-19-infected people among countries. The specific construction process of the COVID-19 pandemic network is as follows.</p>
<p>First, we exclude countries with fewer than 2,000 infected people and then calculate the growth rate of infected people in the remaining 122 countries individually.<disp-formula id="e1">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>g</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mtext>infected</mml:mtext>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#xa0;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mtext>infected</mml:mtext>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>100</mml:mn>
<mml:mo>%</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mtext>&#x2003;</mml:mtext>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1,2</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mn>122</mml:mn>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(1)</label>
</disp-formula>where <inline-formula id="inf1">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>g</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the infected persons growth rate of country <italic>i</italic> in month t, <inline-formula id="inf2">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mtext>infected</mml:mtext>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the number of infected persons of country <italic>i</italic> in month t, and <inline-formula id="inf3">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mtext>infected</mml:mtext>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the number of infected persons in country <italic>i</italic> in month <italic>t</italic>&#x2212;1.</p>
<p>Second, we compute the correlation coefficients of the infected persons&#x2019; growth rate between any two countries. The correlation coefficient is formulated as follows:<disp-formula id="e2">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mrow>
<mml:mi>X</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>Y</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mtext>Cov</mml:mtext>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>X</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>Y</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:msqrt>
<mml:mrow>
<mml:mtext>Var</mml:mtext>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mi>X</mml:mi>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:mtext>Var</mml:mtext>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mi>Y</mml:mi>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msqrt>
</mml:mrow>
</mml:mfrac>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(2)</label>
</disp-formula>where <inline-formula id="inf4">
<mml:math>
<mml:mrow>
<mml:mtext>Cov</mml:mtext>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mtext>X</mml:mtext>
<mml:mo>,</mml:mo>
<mml:mtext>Y</mml:mtext>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is the covariance of X and Y, <inline-formula id="inf5">
<mml:math>
<mml:mrow>
<mml:mtext>Var</mml:mtext>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mtext>X</mml:mtext>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is the variance of X, and <inline-formula id="inf6">
<mml:math>
<mml:mrow>
<mml:mtext>Var</mml:mtext>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mtext>Y</mml:mtext>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is the variance of Y.</p>
<p>Third, we need to set a threshold for correlation coefficients to define the existence of the possible connection. To fulfill this purpose, we take half of the mean of each country&#x2019;s maximum correlation coefficient (approximately 0.4) as the threshold value for the existence of connectedness. If the correlation coefficient between the two countries is higher than the threshold, a line is drawn in the network to connect these two countries, indicating a connection between them.</p>
<p>This method can test the network connectedness between all countries, draw undirected connecting lines in the network, and finally create a COVID-19 pandemic infection network.</p>
</sec>
<sec id="s4-2">
<title>Complex Network Characteristics</title>
<sec id="s4-2-1">
<title>Centrality Analysis</title>
<p>Centrality is an important indicator of each node&#x2019;s status and role in the network, and it can be used to judge whether an individual node is influential [<xref ref-type="bibr" rid="B3">3</xref>]. The higher a node&#x2019;s centrality is, the more significant its influence in the network is, suggesting that it can influence other nodes more prominently. In complex network analysis, there are many ways to characterize the centrality of a node. The most important are betweenness centrality, closeness centrality, eigenvector centrality, and page rank.<list list-type="simple">
<list-item>
<label>1)</label>
<p>Betweenness centrality</p>
</list-item>
<list-item>
<p>In a network, a certain node&#x2019;s degree may be very small, but it may be the intermediate node between any two other nonadjacent nodes. If this node is removed, the connectivity between the nonadjacent nodes will be interrupted. Therefore, the node plays a vital role in the network. For such a node, we can define betweenness.</p>
</list-item>
<list-item>
<p>The core idea is that the interaction between two nonadjacent nodes depends on other nodes in the network, especially those on the shortest path. They exert a certain control over the two nonadjacent nodes. For example, if node A is located on multiple shortest paths between other nonadjacent nodes, node A plays a greater role and has greater betweenness centrality.</p>
</list-item>
<list-item>
<p>Freeman [<xref ref-type="bibr" rid="B20">20</xref>] suggests that the shortest path between nonadjacent nodes <inline-formula id="inf7">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf8">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> will pass some nodes in a network. If <inline-formula id="inf9">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is passed by many other shortest paths, then it is important in the network. Moreover, the importance or influence of <inline-formula id="inf10">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> for <inline-formula id="inf11">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf12">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> can be represented by <inline-formula id="inf13">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, defined as follows:</p>
</list-item>
</list>
<disp-formula id="e3">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mstyle displaystyle="true">
<mml:munder>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>N</mml:mi>
</mml:mrow>
</mml:munder>
<mml:mrow>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>n</mml:mi>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>n</mml:mi>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mstyle>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(3)</label>
</disp-formula>
<list list-type="simple">
<list-item>
<p>where <inline-formula id="inf14">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>n</mml:mi>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the number of shortest paths between nodes <inline-formula id="inf15">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf16">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>; <inline-formula id="inf17">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>n</mml:mi>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is the shortest path between nodes <inline-formula id="inf18">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf19">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, which passes through node <inline-formula id="inf20">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>; and N is the total number of nodes in the network.</p>
</list-item>
<list-item>
<p>Then, the betweenness centrality of <inline-formula id="inf21">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is defined as follows:</p>
</list-item>
</list>
<disp-formula id="e4">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mi>B</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>N</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>N</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>2</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mfrac>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
<label>(4)</label>
</disp-formula>
<list list-type="simple">
<list-item>
<label>2)</label>
<p>Closeness centrality</p>
</list-item>
<list-item>
<p>Sabidussi [<xref ref-type="bibr" rid="B21">21</xref>] proposes that the closeness centrality of <inline-formula id="inf22">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> measures the extent of proximity to other nodes through the shortest path. The closer the node is, the more important it is in the network. The closeness centrality value is the reciprocal of the average distance between node <inline-formula id="inf23">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and all other nodes that <inline-formula id="inf24">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> can reach. Specifically, closeness centrality is defined as follows:</p>
</list-item>
</list>
<disp-formula id="e5">
<mml:math>
<mml:mrow>
<mml:msubsup>
<mml:mi>C</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>c</mml:mi>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:msub>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>&#x393;</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x2260;</mml:mo>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
</mml:mfrac>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(5)</label>
</disp-formula>
<list list-type="simple">
<list-item>
<p>where <inline-formula id="inf25">
<mml:math>
<mml:mi>&#x393;</mml:mi>
</mml:math>
</inline-formula> is the set of nodes that <inline-formula id="inf26">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> can reach, <inline-formula id="inf27">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the average distance to all other reachable nodes of <inline-formula id="inf28">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula id="inf29">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the distance between <inline-formula id="inf30">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf31">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>. The closeness indicator describes the difficulty of reaching other nodes in the network through a certain node <inline-formula id="inf32">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>. It reflects the ability of node <inline-formula id="inf33">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> to exert influence on other nodes in the network. Therefore, the closeness centrality can effectively reflect the global structure of the network.</p>
</list-item>
<list-item>
<label>3)</label>
<p>Eigenvector centrality</p>
</list-item>
<list-item>
<p>Bonacich [<xref ref-type="bibr" rid="B22">22</xref>] suggests that eigenvector centrality is another important centrality measurement method for nodes. For node <inline-formula id="inf34">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, let the centrality score <inline-formula id="inf35">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> be proportional to the sum of the centrality scores of all nodes connected to it.</p>
</list-item>
</list>
<disp-formula id="e6">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>&#x3bb;</mml:mi>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>N</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mstyle>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(6)</label>
</disp-formula>
<list list-type="simple">
<list-item>
<p>where N is the total number of nodes and <inline-formula id="inf36">
<mml:math>
<mml:mi>&#x3bb;</mml:mi>
</mml:math>
</inline-formula> is the maximum eigenvalue. Each score of the eigenvector must be positive.</p>
</list-item>
<list-item>
<label>4)</label>
<p>Page rank</p>
</list-item>
<list-item>
<p>Page rank [<xref ref-type="bibr" rid="B23">23</xref>] can be understood as a random walk on a graph. It can be defined as follows:</p>
</list-item>
</list>
<disp-formula id="e7">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>N</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mstyle>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>d</mml:mi>
<mml:mstyle displaystyle="true">
<mml:munder>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>:</mml:mo>
<mml:msub>
<mml:mi>b</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:munder>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mstyle>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(7)</label>
</disp-formula>
<list list-type="simple">
<list-item>
<p>where <inline-formula id="inf37">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the page rank value of node k; d is the model parameter, usually d &#x3d; 0.85; and <inline-formula id="inf38">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the probability of transition from page i to page j.</p>
</list-item>
</list>
</p>
</sec>
<sec id="s4-2-2">
<title>Small-World Network</title>
<p>The small-world property is an important topological feature of the network. Watts and Strogatz [<xref ref-type="bibr" rid="B10">10</xref>] propose the small-world network model (WS small-world network). They argue that some network systems are large in size but have a relatively small distance between any two nodes. A typical small-world network has a shorter average distance and a larger clustering coefficient. For example, there are no more than six people between any two strangers in a small-world social network.<list list-type="simple">
<list-item>
<label>1)</label>
<p>Clustering coefficient</p>
</list-item>
</list>
</p>
<p>In a WS small-world network, the clustering coefficient quantifies the tendency of the nodes of a complex graph to cluster. In terms of a certain node v in the WS small-world network, <inline-formula id="inf39">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf40">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are two neighboring nodes of node v. If we reconnect <inline-formula id="inf41">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf42">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> by random probability p, then the probability of <inline-formula id="inf43">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf44">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> still being neighboring nodes is <inline-formula id="inf45">
<mml:math>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>p</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula id="inf46">
<mml:math>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>p</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>3</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> is the probability that there is still an edge between <inline-formula id="inf47">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf48">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>. Watts and Strogatz [<xref ref-type="bibr" rid="B10">10</xref>] and Barrat and Weigt [<xref ref-type="bibr" rid="B24">24</xref>] argue that the WS clustering coefficient can be calculated as follows:<disp-formula id="e8">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>W</mml:mi>
<mml:mi>S</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>3</mml:mn>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mi>k</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#xa0;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>p</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>3</mml:mn>
</mml:msup>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
<label>(8)</label>
</disp-formula>
</p>
<p>The initial network is a one-dimensional lattice of N sites, with periodic boundary conditions (i.e., a ring), each vertex being connected to its <inline-formula id="inf49">
<mml:math>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> nearest neighbors. The vertices are then visited one after the other; each link connecting a vertex to one of its <inline-formula id="inf50">
<mml:math>
<mml:mi>k</mml:mi>
</mml:math>
</inline-formula> nearest neighbors in the clockwise sense is left in place with probability <inline-formula id="inf51">
<mml:math>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>p</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> and with probability <inline-formula id="inf52">
<mml:math>
<mml:mrow>
<mml:mo>&#xa0;</mml:mo>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> is reconnected to a randomly chosen other vertex.<list list-type="order">
<list-item>
<label>2)</label>
<p>Average path length</p>
</list-item>
</list>
</p>
<p>The average distance between any two nodes would also show interesting properties in a given complex network. The diameter D of a complex network is defined as the maximum distance between any pair of nodes.</p>
<p>Watts and Strogatz [<xref ref-type="bibr" rid="B10">10</xref>] argue that in terms of random networks, almost all networks have the same diameter. This means that the Nth-order random network with probability P has a tiny change in diameter. Watts [<xref ref-type="bibr" rid="B25">25</xref>] suggests that the diameter D is usually concentrated as follows:<disp-formula id="e9">
<mml:math>
<mml:mrow>
<mml:mi>D</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>ln</mml:mi>
<mml:mo>&#x2061;</mml:mo>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>ln</mml:mi>
<mml:mrow>
<mml:mo>&#x2329;</mml:mo>
<mml:mi>k</mml:mi>
<mml:mo>&#x232a;</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x2248;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>ln</mml:mi>
<mml:mo>&#x2061;</mml:mo>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>ln</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mfrac>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
<label>(9)</label>
</disp-formula>
</p>
<p>Supposing <inline-formula id="inf53">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mtext>ER</mml:mtext>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the average path length of the ER random network, for a randomly selected node in the ER random network, there are approximately <inline-formula id="inf54">
<mml:math>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo>&#x2329;</mml:mo>
<mml:mi>k</mml:mi>
<mml:mo>&#x232a;</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mi>E</mml:mi>
<mml:mi>R</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> other nodes in the network with a distance from the selected node that is equal or very close to <inline-formula id="inf55">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mtext>ER</mml:mtext>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>. Therefore, <inline-formula id="inf56">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mtext>ER</mml:mtext>
</mml:mrow>
</mml:msub>
<mml:mo>&#x221d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>ln</mml:mi>
<mml:mo>&#x2061;</mml:mo>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>ln</mml:mi>
<mml:mrow>
<mml:mo>&#x2329;</mml:mo>
<mml:mi>k</mml:mi>
<mml:mo>&#x232a;</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
</inline-formula>. It is a typical small-world property that the average path length is proportional to the logarithmic growth function. Since <inline-formula id="inf57">
<mml:math>
<mml:mrow>
<mml:mi>ln</mml:mi>
<mml:mo>&#x2061;</mml:mo>
<mml:mi>N</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> grows slowly with N, a large random network may have small average path lengths.</p>
</sec>
<sec id="s4-2-3">
<title>Modularity Class</title>
<p>Newman [<xref ref-type="bibr" rid="B26">26</xref>, <xref ref-type="bibr" rid="B27">27</xref>] proposes modularity, which enables a clear evaluation indicator to measure the segmentation of network communities. In other words, modularity refers to the difference between an ordinary network and a random network under a specific community division criterion. Because the random network does not have a community structure, the larger the difference is, the better the community division will be.</p>
<p>Newman [<xref ref-type="bibr" rid="B27">27</xref>] defines modularity as follows:<disp-formula id="e10">
<mml:math>
<mml:mrow>
<mml:mi>Q</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mn>4</mml:mn>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:munder>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:munder>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>A</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>k</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi>k</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mstyle>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mn>4</mml:mn>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:munder>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:munder>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>A</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>k</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi>k</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mstyle>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(10)</label>
</disp-formula>where m is the total number of edges in the network, A is the corresponding adjacency matrix of the network, and <inline-formula id="inf58">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>A</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> represents the existence of an edge between node i and node j. Otherwise, there is no edge connection. <inline-formula id="inf59">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>k</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the degree of node i, <inline-formula id="inf60">
<mml:math>
<mml:mrow>
<mml:mo>&#xa0;</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the label of node i belonging to a community, and <inline-formula id="inf61">
<mml:math>
<mml:mrow>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mn>2</mml:mn>
</mml:mfrac>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> if and only if <inline-formula id="inf62">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>; otherwise, <inline-formula id="inf63">
<mml:math>
<mml:mrow>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mn>2</mml:mn>
</mml:mfrac>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
</sec>
</sec>
</sec>
<sec sec-type="results|discussion" id="s5">
<title>Empirical Results and Discussion</title>
<sec id="s5-1">
<title>COVID-19 Pandemic Network</title>
<p>In this section, we present our COVID-19 pandemic network. We first calculate the daily growth rate of the infected population in 122 countries individually and then calculate the correlation coefficient <inline-formula id="inf64">
<mml:math>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> of the growth rate between any two countries. Furthermore, the threshold value for the existence of connectedness is set as 0.4 since the half mean of each country&#x2019;s maximum correlation coefficient is 0.38. If the correlation coefficient between country i and country j is higher than the threshold value, i.e., <inline-formula id="inf65">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mi mathvariant="normal">&#x3e;</mml:mi>
<mml:mn>0.4</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, then the element <inline-formula id="inf66">
<mml:math>
<mml:mrow>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> in the connectedness matrix is 1; otherwise, it is 0. If <inline-formula id="inf67">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, there is an edge between country i and country j, and if <inline-formula id="inf68">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, there is no edge between country i and country j. In addition, the value of the element on the diagonal of the connectedness matrix is set as 0, which indicates that there is no link between any country and itself. We obtain our COVID-19 pandemic connectedness matrix through the above calculation method (as the number of countries involved is 122, we cannot present the 122 &#xd7; 122 matrix here). Because a zero growth rate will affect the similarity calculation, we excluded 91 countries and regions with fewer than 2,000 infected people.</p>
<p>Finally, the COVID-19 pandemic network obtained in this study is a complex network without considering the direction, and it is an undirected network with 122 nodes and 958 connected edges.</p>
<p>Using the software Gephi, we generate a visual graph of our network. The results are shown in <xref ref-type="fig" rid="F1">Figure 1</xref>. Taking China, the United States, and Brazil as examples, China has connectedness with Singapore, Japan, and Thailand; the United States has connectedness with Australia, Kenya, Colombia, Pakistan, Dominica, Turkey, and Luxembourg; and Brazil has connectedness with 16 countries, including Austria, Portugal, Denmark, Saudi Arabia, and France.</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption>
<p>The global COVID-19 pandemic network. Note: This is the global COVID-19 pandemic network. It excludes countries with fewer than 2,000 infected people. When the correlation of the growth rate of infected people is larger than 0.4, there is a connected edge between countries.</p>
</caption>
<graphic xlink:href="fphy-08-602075-g001.tif"/>
</fig>
<p>Then, we use Gephi to obtain the network topology characteristic values, which is the basis for the next step of the analysis. <xref ref-type="fig" rid="F2">Figures 2</xref> and <xref ref-type="fig" rid="F3">3</xref> show the COVID-19 pandemic network parameters. <xref ref-type="fig" rid="F2">Figure 2</xref> shows the degree distribution in our COVID-19 pandemic network. The overall distribution of the graph shows that the COVID-19 pandemic network is relatively dispersed. <xref ref-type="fig" rid="F3">Figure 3</xref> shows the clustering coefficient graph. The larger the clustering coefficient is, the higher the extent of the connection between neighbors is. Our COVID-19 pandemic network has a clustering coefficient of 0.58. This large clustering coefficient indicates that the COVID-19 pandemic network is a very close world.</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption>
<p>The degree distribution of the global network. Note: <xref ref-type="fig" rid="F2">Figure 2</xref> represents the degree distribution. The vertical and horizontal axes of each subplot are node counts and parameter distribution values, respectively. The horizontal axis represents the degree value of each country. The vertical axis represents the number of countries. For example, value &#x3d; 2 and count &#x3d; 7 means that there are seven countries, and they all have a degree of two.</p>
</caption>
<graphic xlink:href="fphy-08-602075-g002.tif"/>
</fig>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption>
<p>The clustering coefficient distribution of the global network. Note: <xref ref-type="fig" rid="F3">Figure 3</xref> represents the distribution of clustering coefficients in various countries. The vertical and horizontal axes of each subplot are node counts and parameter distribution values, respectively. The horizontal axis represents the clustering coefficient value of each country. The vertical axis represents the number of countries.</p>
</caption>
<graphic xlink:href="fphy-08-602075-g003.tif"/>
</fig>
<p>Other overall characteristics of the COVID-19 pandemic network are shown in the following table.</p>
<p>
<xref ref-type="table" rid="T1">Table 1</xref> shows that the COVID-19 pandemic network has 122 nodes, and the number of edges between nodes is 985 with an average degree of 7.85, average path length of 3.104, clustering coefficient of 0.58, and diameter of 8. Moreover, the clustering coefficient is large, so the network has close-world network characteristics.</p>
<table-wrap id="T1" position="float">
<label>TABLE 1</label>
<caption>
<p>Topological characteristics of the COVID-19 pandemic network.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Network</th>
<th align="center">N</th>
<th align="center">E</th>
<th align="center">&#x3c;d&#x3e;</th>
<th align="center">K</th>
<th align="center">C</th>
<th align="center">D</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">COVID-19 pandemic</td>
<td align="center">122</td>
<td align="center">958</td>
<td align="center">7.85</td>
<td align="center">3.104</td>
<td align="center">0.58</td>
<td align="center">8</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<fn>
<p>
<xref ref-type="table" rid="T1">Table 1</xref> presents the topological information of the COVID-19 pandemic network. N is the number of nodes. E is the number of edges. &#x3c;d&#x3e; is the average degree of the whole network. K represents the average path length of the network. C is the clustering coefficient of the network. D is the diameter of the network.</p>
</fn>
</table-wrap-foot>
</table-wrap>
<p>In addition, the small-world network has the characteristics of a small path length and a high clustering coefficient between nodes. Our global COVID-19 pandemic network&#x2019;s average path length is 3.104, and its clustering coefficient is 0.58, indicating that the global COVID-19 pandemic network has some characteristics of a small-world network.</p>
</sec>
<sec id="s5-2">
<title>Connectedness Characteristics of the Global COVID-19 Pandemic Network</title>
<p>In this section, we further analyze some important characteristics of the global COVID-19 pandemic network. Specifically, we focus on the degree, triangles, centrality, modularity class, and authority and then provide the visual results.</p>
<p>
<xref ref-type="fig" rid="F4">Figure 4</xref> represents the degree of each country in the global COVID-19 pandemic network. The degree of country i is the total number of edges directly connected to that country. The deeper a country&#x2019;s color is, the greater its degree is. As shown in <xref ref-type="fig" rid="F4">Figure 4</xref>, Brazil has the deepest color on the American continents; in Europe, Austria has the greatest degree; in Asia, Israel and Sri Lanka have the highest number of edges; in Oceania, the color of Australia is the deepest; and in Africa, the countries with the greatest degree are South Africa and Morocco. The above results indicate that these countries have the greatest degrees with other countries and a prominent ability to spread COVID-19 to other countries. Thus, more attention should be paid to their capacity and measures for COVID-19 pandemic prevention and control.</p>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption>
<p>The degree of the global COVID-19 pandemic network.</p>
</caption>
<graphic xlink:href="fphy-08-602075-g004.tif"/>
</fig>
<p>
<xref ref-type="fig" rid="F5">Figures 5</xref>&#x2013;<xref ref-type="fig" rid="F8">8</xref> show the centrality analysis results, reflecting the relative importance of each node in the network. <xref ref-type="fig" rid="F5">Figure 5</xref> shows betweenness centrality. The countries with the deepest colors are the Democratic Republic of the Congo, Australia, and Croatia, which are located in Africa, Oceania, and Europe, respectively. This finding indicates that these three countries play an important betweenness role in the COVID-19 pandemic network. Additionally, Canada and Cuba in North America are also significant. We may more easily halt the global spread of COVID-19 if we control the pandemic in these three countries first.</p>
<fig id="F5" position="float">
<label>FIGURE 5</label>
<caption>
<p>The betweenness centrality of the global COVID-19 pandemic network.</p>
</caption>
<graphic xlink:href="fphy-08-602075-g005.tif"/>
</fig>
<fig id="F6" position="float">
<label>FIGURE 6</label>
<caption>
<p>The eigencentrality of the global COVID-19 pandemic network.</p>
</caption>
<graphic xlink:href="fphy-08-602075-g006.tif"/>
</fig>
<fig id="F7" position="float">
<label>FIGURE 7</label>
<caption>
<p>The closeness centrality of the global COVID-19 pandemic network.</p>
</caption>
<graphic xlink:href="fphy-08-602075-g007.tif"/>
</fig>
<fig id="F8" position="float">
<label>FIGURE 8</label>
<caption>
<p>The harmonic closeness of the global COVID-19 pandemic network.</p>
</caption>
<graphic xlink:href="fphy-08-602075-g008.tif"/>
</fig>
<p>
<xref ref-type="fig" rid="F6">Figure 6</xref> shows eigenvector centrality. The three countries with the deepest colors are Moldova, Sri Lanka, and Austria, located in Europe, Asia, and Europe, respectively. This finding shows that the three countries have the highest centrality scores and are the nodes with the greatest importance in the COVID-19 pandemic network. Again, Austria shows its importance in the COVID-19 pandemic network, indicating that the effective control of COVID-19 in Austria has a significant role in halting the global spread of the COVID-19 pandemic.</p>
<p>
<xref ref-type="fig" rid="F7">Figure 7</xref> represents closeness centrality. The three countries with the deepest colors are Kazakhstan, Iraq, and Uzbekistan, all located in Asia. This means that Kazakhstan, Iraq, and Uzbekistan may be important for Asian COVID-19 control. <xref ref-type="fig" rid="F8">Figure 8</xref> shows harmonic closeness centrality. The empirical results are the same as those shown in <xref ref-type="fig" rid="F7">Figure 7</xref>.</p>
<p>
<xref ref-type="fig" rid="F9">Figure 9</xref> shows the analysis results of authority, reflecting the influence of nodes in the network. The three countries with the deepest colors are Moldova, Israel, and Austria, located in Europe, Asia, and Europe, respectively. This indicates that the infections in Moldova, Israel, and Austria are highly dangerous, as these three countries may have high virus spread capacity.</p>
<fig id="F9" position="float">
<label>FIGURE 9</label>
<caption>
<p>The authority of the global COVID-19 pandemic network.</p>
</caption>
<graphic xlink:href="fphy-08-602075-g009.tif"/>
</fig>
<p>
<xref ref-type="fig" rid="F10">Figure 10</xref> shows modularity-class analysis results, describing the community situation in the network. The results show that the modularity coefficient is 0.526, and the COVID-19 pandemic network is divided into 10 communities, representing community structures. Community 0 contains 8 countries, including Palestine, Poland, and the United Arab Emirates. Community 1 contains Cuba, the Democratic Republic of the Congo, and 23 other countries. Community 2 contains Mexico, Moldova, Sri Lanka, Israel, and so on. Community 3 contains 13 countries, including China, Canada, Britain, India, Germany, Australia, and Japan. Community 4 contains 24 countries, including France, Brazil, Austria, and South Africa. Community 5 contains Bahrain, Iraq, and Oman. Community 6 contains 11 countries, including Bangladesh, Kyrgyzstan, and Ghana. The countries in Community 7 are Uzbekistan, Kazakhstan, and Guatemala. The countries in Community 8 are Iran, South Korea, and Italy. Community 9 contains 16 countries, including the United States, the Russian Federation, and Colombia.</p>
<fig id="F10" position="float">
<label>FIGURE 10</label>
<caption>
<p>The modularity class of the global COVID-19 pandemic network.</p>
</caption>
<graphic xlink:href="fphy-08-602075-g010.tif"/>
</fig>
</sec>
<sec id="s5-3">
<title>The Determinants of Connectedness</title>
<p>According to the above analysis, the connectedness of the global COVID-19 infection network varies across different countries. Therefore, what factors influence the network connectedness of COVID-19 infection? Hereafter, this study further explores how economic factors, population density, medical level, and other social factors influence the connectedness of COVID-19 by using a quantitative regression method to provide a theoretical basis and guidance for policymakers&#x2019; prevention and control measures.</p>
<p>We build the econometric model as follows:<disp-formula id="e11">
<mml:math>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mtext>connectedness</mml:mtext>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>&#x3b2;</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>&#x3b2;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mtext>LnDensity</mml:mtext>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>&#x3b2;</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mtext>LnGDP</mml:mtext>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>&#x3b2;</mml:mi>
<mml:mn>3</mml:mn>
</mml:msub>
<mml:mtext>LnExport</mml:mtext>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>&#x3b2;</mml:mi>
<mml:mn>4</mml:mn>
</mml:msub>
<mml:mtext>LnImport</mml:mtext>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>&#x3b2;</mml:mi>
<mml:mn>5</mml:mn>
</mml:msub>
<mml:mtext>Inflation</mml:mtext>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>&#x3b2;</mml:mi>
<mml:mn>5</mml:mn>
</mml:msub>
<mml:mtext>Expense</mml:mtext>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>&#x3b2;</mml:mi>
<mml:mn>6</mml:mn>
</mml:msub>
<mml:mtext>LifeExpectancy</mml:mtext>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>&#x3b5;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
</disp-formula>where connectedness<sub>
<italic>i</italic>
</sub> represents degree, eigenvector centrality, betweenness centrality, closeness centrality, harmonic centrality, page rank, authority, hub, and triangles separately. LnDensity means the logarithms of population density. LnGDP is the logarithms of economic size. LnExport is the logarithms of total exports. LnImport is the logarithms of total imports. Inflation indicates monetary policy. Expense represents government expenditure. Life represents life expectancy, reflecting the quality of medical treatment.</p>
<p>
<xref ref-type="table" rid="T2">Table 2</xref> shows the regression results between the characteristics of the COVID-19 pandemic network and other possible determinant factors. In columns (1)&#x2013;(7), we investigate how the degree, eigenvector centrality, betweenness centrality, closeness centrality, harmonic closeness centrality, page rank, authority, hub, and triangles are affected by possible influencing factors.</p>
<table-wrap id="T2" position="float">
<label>TABLE 2</label>
<caption>
<p>Determinants of connectedness: global.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th rowspan="2" align="left">Variables</th>
<th align="center">(1)</th>
<th align="center">(2)</th>
<th align="center">(3)</th>
<th align="center">(4)</th>
<th align="center">(5)</th>
<th align="center">(6)</th>
<th align="center">(7)</th>
<th align="center">(8)</th>
<th align="center">(9)</th>
</tr>
<tr>
<th align="center">Degree</th>
<th align="center">Eigen</th>
<th align="center">Betweenness</th>
<th align="center">Closeness</th>
<th align="center">Harmonic</th>
<th align="center">Page rank</th>
<th align="center">Authority</th>
<th align="center">Hub</th>
<th align="center">Triangles</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td rowspan="2" align="left">LnDensity</td>
<td align="center">0.7450</td>
<td align="center">0.0217</td>
<td align="center">&#x2212;13.9320</td>
<td align="center">&#x2212;0.0020</td>
<td align="center">0.0024</td>
<td align="center">0.0007&#x2a;&#x2a;</td>
<td align="center">0.0036</td>
<td align="center">0.0036</td>
<td align="center">2.1949</td>
</tr>
<tr>
<td align="center">(1.46)</td>
<td align="center">(0.75)</td>
<td align="center">(&#x2212;0.53)</td>
<td align="center">(&#x2212;0.12)</td>
<td align="center">(0.14)</td>
<td align="center">(2.03)</td>
<td align="center">(0.55)</td>
<td align="center">(0.55)</td>
<td align="center">(1.50)</td>
</tr>
<tr>
<td rowspan="2" align="left">LnGDP</td>
<td align="center">2.9796&#x2a;&#x2a;</td>
<td align="center">0.1207&#x2a;</td>
<td align="center">72.1867&#x2a;&#x2a;</td>
<td align="center">0.0440</td>
<td align="center">0.0551&#x2a;</td>
<td align="center">0.0025&#x2a;&#x2a;&#x2a;</td>
<td align="center">0.0249</td>
<td align="center">0.0249</td>
<td align="center">8.1021&#x2a;&#x2a;</td>
</tr>
<tr>
<td align="center">(2.28)</td>
<td align="center">(1.76)</td>
<td align="center">(2.39)</td>
<td align="center">(1.60)</td>
<td align="center">(1.81)</td>
<td align="center">(3.51)</td>
<td align="center">(1.63)</td>
<td align="center">(1.63)</td>
<td align="center">(2.08)</td>
</tr>
<tr>
<td rowspan="2" align="left">LnExport</td>
<td align="center">0.2037</td>
<td align="center">&#x2212;0.0009</td>
<td align="center">&#x2212;10.2764</td>
<td align="center">&#x2212;0.0181</td>
<td align="center">&#x2212;0.0111</td>
<td align="center">0.0004</td>
<td align="center">&#x2212;0.0014</td>
<td align="center">&#x2212;0.0014</td>
<td align="center">0.3559</td>
</tr>
<tr>
<td align="center">(0.10)</td>
<td align="center">(&#x2212;0.01)</td>
<td align="center">(&#x2212;0.20)</td>
<td align="center">(&#x2212;0.52)</td>
<td align="center">(&#x2212;0.27)</td>
<td align="center">(0.31)</td>
<td align="center">(&#x2212;0.06)</td>
<td align="center">(&#x2212;0.06)</td>
<td align="center">(0.05)</td>
</tr>
<tr>
<td rowspan="2" align="left">LnImport</td>
<td align="center">&#x2212;4.1171</td>
<td align="center">&#x2212;0.1654</td>
<td align="center">&#x2212;73.2675</td>
<td align="center">&#x2212;0.0328</td>
<td align="center">&#x2212;0.0537</td>
<td align="center">&#x2212;0.0036&#x2a;&#x2a;</td>
<td align="center">&#x2212;0.0341</td>
<td align="center">&#x2212;0.0341</td>
<td align="center">&#x2212;12.4868</td>
</tr>
<tr>
<td align="center">(&#x2212;1.50)</td>
<td align="center">(&#x2212;1.12)</td>
<td align="center">(&#x2212;1.06)</td>
<td align="center">(&#x2212;0.80)</td>
<td align="center">(&#x2212;1.05)</td>
<td align="center">(&#x2212;2.36)</td>
<td align="center">(&#x2212;1.03)</td>
<td align="center">(&#x2212;1.03)</td>
<td align="center">(&#x2212;1.48)</td>
</tr>
<tr>
<td rowspan="2" align="left">Inflation</td>
<td align="center">&#x2212;0.0531</td>
<td align="center">&#x2212;0.0037</td>
<td align="center">&#x2212;6.4161&#x2a;&#x2a;</td>
<td align="center">&#x2212;0.0000</td>
<td align="center">&#x2212;0.0001</td>
<td align="center">&#x2212;0.0001&#x2a;</td>
<td align="center">&#x2212;0.0010</td>
<td align="center">&#x2212;0.0010</td>
<td align="center">&#x2212;0.0766</td>
</tr>
<tr>
<td align="center">(&#x2212;0.78)</td>
<td align="center">(&#x2212;1.03)</td>
<td align="center">(&#x2212;2.39)</td>
<td align="center">(&#x2212;0.02)</td>
<td align="center">(&#x2212;0.02)</td>
<td align="center">(&#x2212;1.78)</td>
<td align="center">(&#x2212;1.29)</td>
<td align="center">(&#x2212;1.29)</td>
<td align="center">(&#x2212;0.33)</td>
</tr>
<tr>
<td rowspan="2" align="left">Expense</td>
<td align="center">0.2523&#x2a;&#x2a;&#x2a;</td>
<td align="center">0.0126&#x2a;&#x2a;&#x2a;</td>
<td align="center">2.4979</td>
<td align="center">&#x2212;0.0001</td>
<td align="center">0.0012</td>
<td align="center">0.0001&#x2a;&#x2a;&#x2a;</td>
<td align="center">0.0029&#x2a;&#x2a;&#x2a;</td>
<td align="center">0.0029&#x2a;&#x2a;&#x2a;</td>
<td align="center">0.7041&#x2a;&#x2a;&#x2a;</td>
</tr>
<tr>
<td align="center">(3.53)</td>
<td align="center">(3.47)</td>
<td align="center">(1.06)</td>
<td align="center">(&#x2212;0.03)</td>
<td align="center">(0.55)</td>
<td align="center">(3.39)</td>
<td align="center">(3.48)</td>
<td align="center">(3.48)</td>
<td align="center">(3.25)</td>
</tr>
<tr>
<td rowspan="2" align="left">Life</td>
<td align="center">0.0605</td>
<td align="center">0.0067</td>
<td align="center">0.6182</td>
<td align="center">0.0031</td>
<td align="center">0.0033</td>
<td align="center">0.0000</td>
<td align="center">0.0019</td>
<td align="center">0.0019</td>
<td align="center">0.5413</td>
</tr>
<tr>
<td align="center">(0.54)</td>
<td align="center">(1.12)</td>
<td align="center">(0.14)</td>
<td align="center">(1.28)</td>
<td align="center">(1.29)</td>
<td align="center">(0.46)</td>
<td align="center">(1.38)</td>
<td align="center">(1.38)</td>
<td align="center">(1.47)</td>
</tr>
<tr>
<td rowspan="2" align="left">Constant</td>
<td align="center">7.0192</td>
<td align="center">0.0728</td>
<td align="center">217.2144</td>
<td align="center">0.2184</td>
<td align="center">0.2472</td>
<td align="center">0.0080&#x2a;</td>
<td align="center">&#x2212;0.0029</td>
<td align="center">&#x2212;0.0029</td>
<td align="center">8.3716</td>
</tr>
<tr>
<td align="center">(1.00)</td>
<td align="center">(0.21)</td>
<td align="center">(0.92)</td>
<td align="center">(1.48)</td>
<td align="center">(1.45)</td>
<td align="center">(1.95)</td>
<td align="center">(&#x2212;0.04)</td>
<td align="center">(&#x2212;0.04)</td>
<td align="center">(0.41)</td>
</tr>
<tr>
<td align="left">Observations</td>
<td align="center">79</td>
<td align="center">79</td>
<td align="center">79</td>
<td align="center">79</td>
<td align="center">79</td>
<td align="center">79</td>
<td align="center">79</td>
<td align="center">79</td>
<td align="center">79</td>
</tr>
<tr>
<td align="left">R-squared</td>
<td align="center">0.228</td>
<td align="center">0.212</td>
<td align="center">0.102</td>
<td align="center">0.039</td>
<td align="center">0.057</td>
<td align="center">0.232</td>
<td align="center">0.218</td>
<td align="center">0.218</td>
<td align="center">0.232</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<fn>
<p>This table constructs regression models for global determinants of connectedness. Dependent variables are network connectedness characteristics. Independent variables are economic and social factors. Values in parentheses are the T statistical values; &#x2a;&#x2a;&#x2a;, &#x2a;&#x2a;, and &#x2a; indicate significance at the levels of 1, 5, and 10%, respectively.</p>
</fn>
</table-wrap-foot>
</table-wrap>
<p>In columns (1) and (2), LnGDP and Expense are significantly positive at the 10% confidence level, indicating that economic level and government expenditure will significantly increase degree and eigenvector centrality. In column (3), LnGDP is also significantly positive at the 5% confidence level, indicating that the economic scale significantly increases betweenness centrality, consistent with the result of degree and eigenvector centrality. Inflation is significantly negative at the 5% confidence level, suggesting that it significantly reduces betweenness centrality. In column (5), the estimated coefficient of LnGDP is still significantly positive at 10%, suggesting that economic size will significantly increase harmonic closeness centrality. In column (6), LnDensity, LnGDP, and Expense are all significantly positive at the 5% confidence level, indicating that population density, economic scale, and government expenditure increase page rank. However, LnImport is significantly negative at 5%, indicating that imports significantly reduce page rank. In columns (7) and (8), Expense has a significantly positive coefficient at 1%, meaning that the amount of government expenditure will significantly increase authority and hub. In column (9), LnGDP and Expense are significantly positive at 5%, indicating that the size of the economy and government spending significantly increase triangles.</p>
<p>Overall, the economic development level and government spending show significant positive effects on COVID-19 infection connectedness. If policymakers hope to curb the spread of COVID-19 effectively, they should give priority to the COVID-19 pandemic, appropriately reduce economic activities, and avoid crowd gatherings to reduce the risk of infection. Moreover, government expenditures need to be allocated more effectively. Controlling and preventing the spread of COVID-19 should be the first goal of government expenditures. More government resources should be used to purchase medical devices and improve medical staff protection and treatment. The United States is a case in point. As the United States has prioritized the economy in its COVID-19 prevention policy, a large amount of fiscal spending has been used to subsidize economic activities rather than medical resources. As a result, the number of confirmed COVID-19 cases in the United States is approaching 9 million.</p>
</sec>
<sec id="s5-4">
<title>The Determinants of Connectedness: Asia and Europe</title>
<p>To further analyze how economic and social factors affect Asian and European countries&#x2019; connectedness characteristics differently, this study divides the samples into Asian and European countries.</p>
<p>
<xref ref-type="table" rid="T3">Table 3</xref> shows the empirical results in Asia. In Asia, LnDensity, LnGDP, and LnExport are significantly positive at the 10% confidence level for degree, eigenvector, authority, hub, and triangles, indicating that population density, economic activities, and export activities show significantly positive effects in the Asian COVID-19 pandemic network. However, LnImport is persistently significantly negative at the 10 or 5% confidence level for degree, eigenvector, page rank, authority, hub, and triangles, showing that imports can effectively reduce the characteristics of the COVID-19 pandemic network in Asia.</p>
<table-wrap id="T3" position="float">
<label>TABLE 3</label>
<caption>
<p>Determinants of connectedness: Asia.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th rowspan="2" align="left">Variables</th>
<th align="center">(1)</th>
<th align="center">(2)</th>
<th align="center">(3)</th>
<th align="center">(4)</th>
<th align="center">(5)</th>
<th align="center">(6)</th>
<th align="center">(7)</th>
<th align="center">(8)</th>
<th align="center">(9)</th>
</tr>
<tr>
<th align="center">Degree</th>
<th align="center">Eigen</th>
<th align="center">Betweenness</th>
<th align="center">Closeness</th>
<th align="center">Harmonic</th>
<th align="center">Page rank</th>
<th align="center">Authority</th>
<th align="center">Hub</th>
<th align="center">Triangles</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td rowspan="2" align="left">LnDensity</td>
<td align="center">3.1811&#x2a;</td>
<td align="center">0.1962&#x2a;&#x2a;</td>
<td align="center">21.1112</td>
<td align="center">&#x2212;0.0711</td>
<td align="center">&#x2212;0.0586</td>
<td align="center">0.0013&#x2a;</td>
<td align="center">0.0438&#x2a;&#x2a;</td>
<td align="center">0.0438&#x2a;&#x2a;</td>
<td align="center">10.8935&#x2a;&#x2a;</td>
</tr>
<tr>
<td align="center">(2.28)</td>
<td align="center">(2.87)</td>
<td align="center">(0.69)</td>
<td align="center">(&#x2212;1.01)</td>
<td align="center">(&#x2212;0.88)</td>
<td align="center">(1.92)</td>
<td align="center">(2.87)</td>
<td align="center">(2.87)</td>
<td align="center">(2.80)</td>
</tr>
<tr>
<td rowspan="2" align="left">LnGDP</td>
<td align="center">6.5357&#x2a;</td>
<td align="center">0.3872&#x2a;</td>
<td align="center">62.9644</td>
<td align="center">0.0091</td>
<td align="center">0.0281</td>
<td align="center">0.0038&#x2a;</td>
<td align="center">0.0874&#x2a;</td>
<td align="center">0.0874&#x2a;</td>
<td align="center">21.9928&#x2a;</td>
</tr>
<tr>
<td align="center">(2.00)</td>
<td align="center">(2.30)</td>
<td align="center">(0.79)</td>
<td align="center">(0.09)</td>
<td align="center">(0.26)</td>
<td align="center">(1.96)</td>
<td align="center">(2.29)</td>
<td align="center">(2.29)</td>
<td align="center">(2.24)</td>
</tr>
<tr>
<td rowspan="2" align="left">LnExport</td>
<td align="center">10.9008</td>
<td align="center">0.6387&#x2a;</td>
<td align="center">50.8330</td>
<td align="center">0.0305</td>
<td align="center">0.0631</td>
<td align="center">0.0059</td>
<td align="center">0.1464&#x2a;</td>
<td align="center">0.1464&#x2a;</td>
<td align="center">35.9940&#x2a;</td>
</tr>
<tr>
<td align="center">(1.78)</td>
<td align="center">(2.16)</td>
<td align="center">(0.37)</td>
<td align="center">(0.16)</td>
<td align="center">(0.31)</td>
<td align="center">(1.36)</td>
<td align="center">(2.19)</td>
<td align="center">(2.19)</td>
<td align="center">(1.96)</td>
</tr>
<tr>
<td rowspan="2" align="left">LnImport</td>
<td align="center">&#x2212;21.0506&#x2a;&#x2a;</td>
<td align="center">&#x2212;1.2356&#x2a;&#x2a;</td>
<td align="center">&#x2212;149.3194</td>
<td align="center">&#x2212;0.0607</td>
<td align="center">&#x2212;0.1177</td>
<td align="center">&#x2212;0.0118&#x2a;</td>
<td align="center">&#x2212;0.2827&#x2a;&#x2a;</td>
<td align="center">&#x2212;0.2827&#x2a;&#x2a;</td>
<td align="center">&#x2212;70.3091&#x2a;&#x2a;</td>
</tr>
<tr>
<td align="center">(&#x2212;2.43)</td>
<td align="center">(&#x2212;3.04)</td>
<td align="center">(&#x2212;0.74)</td>
<td align="center">(&#x2212;0.25)</td>
<td align="center">(&#x2212;0.46)</td>
<td align="center">(&#x2212;1.92)</td>
<td align="center">(&#x2212;3.06)</td>
<td align="center">(&#x2212;3.06)</td>
<td align="center">(&#x2212;2.81)</td>
</tr>
<tr>
<td rowspan="2" align="left">Inflation</td>
<td align="center">0.0684</td>
<td align="center">&#x2212;0.0058</td>
<td align="center">&#x2212;7.8613</td>
<td align="center">0.0080</td>
<td align="center">0.0072</td>
<td align="center">0.0000</td>
<td align="center">&#x2212;0.0025</td>
<td align="center">&#x2212;0.0025</td>
<td align="center">0.4325</td>
</tr>
<tr>
<td align="center">(0.19)</td>
<td align="center">(&#x2212;0.34)</td>
<td align="center">(&#x2212;0.82)</td>
<td align="center">(0.52)</td>
<td align="center">(0.48)</td>
<td align="center">(0.19)</td>
<td align="center">(&#x2212;0.65)</td>
<td align="center">(&#x2212;0.65)</td>
<td align="center">(0.41)</td>
</tr>
<tr>
<td rowspan="2" align="left">Expense</td>
<td align="center">0.1327</td>
<td align="center">0.0092</td>
<td align="center">3.9181</td>
<td align="center">&#x2212;0.0034</td>
<td align="center">&#x2212;0.0019</td>
<td align="center">0.0000</td>
<td align="center">0.0023</td>
<td align="center">0.0023</td>
<td align="center">0.3640</td>
</tr>
<tr>
<td align="center">(0.46)</td>
<td align="center">(0.67)</td>
<td align="center">(0.74)</td>
<td align="center">(&#x2212;0.35)</td>
<td align="center">(&#x2212;0.20)</td>
<td align="center">(0.22)</td>
<td align="center">(0.74)</td>
<td align="center">(0.74)</td>
<td align="center">(0.43)</td>
</tr>
<tr>
<td rowspan="2" align="left">Life</td>
<td align="center">&#x2212;0.3162</td>
<td align="center">&#x2212;0.0248</td>
<td align="center">&#x2212;2.2921</td>
<td align="center">0.0116</td>
<td align="center">0.0087</td>
<td align="center">0.0001</td>
<td align="center">&#x2212;0.0051</td>
<td align="center">&#x2212;0.0051</td>
<td align="center">&#x2212;0.6678</td>
</tr>
<tr>
<td align="center">(&#x2212;0.69)</td>
<td align="center">(&#x2212;1.13)</td>
<td align="center">(&#x2212;0.22)</td>
<td align="center">(0.56)</td>
<td align="center">(0.42)</td>
<td align="center">(0.44)</td>
<td align="center">(&#x2212;1.05)</td>
<td align="center">(&#x2212;1.05)</td>
<td align="center">(&#x2212;0.50)</td>
</tr>
<tr>
<td rowspan="2" align="left">Constant</td>
<td align="center">66.9493&#x2a;</td>
<td align="center">4.1986&#x2a;&#x2a;</td>
<td align="center">655.5296</td>
<td align="center">0.2487</td>
<td align="center">0.5011</td>
<td align="center">0.0241</td>
<td align="center">0.9375&#x2a;&#x2a;</td>
<td align="center">0.9375&#x2a;&#x2a;</td>
<td align="center">188.7532</td>
</tr>
<tr>
<td align="center">(1.88)</td>
<td align="center">(2.42)</td>
<td align="center">(0.83)</td>
<td align="center">(0.16)</td>
<td align="center">(0.29)</td>
<td align="center">(1.08)</td>
<td align="center">(2.39)</td>
<td align="center">(2.39)</td>
<td align="center">(1.77)</td>
</tr>
<tr>
<td align="left">Observations</td>
<td align="center">16</td>
<td align="center">16</td>
<td align="center">16</td>
<td align="center">16</td>
<td align="center">16</td>
<td align="center">16</td>
<td align="center">16</td>
<td align="center">16</td>
<td align="center">16</td>
</tr>
<tr>
<td align="left">R-squared</td>
<td align="center">0.545</td>
<td align="center">0.632</td>
<td align="center">0.250</td>
<td align="center">0.311</td>
<td align="center">0.292</td>
<td align="center">0.520</td>
<td align="center">0.640</td>
<td align="center">0.640</td>
<td align="center">0.611</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<fn>
<p>Note: This table constructs regression models for the determinants of connectedness in Asia. Dependent variables are network connectedness characteristics. Independent variables are economic and social factors. Values in parentheses are the T statistical values; &#x2a;&#x2a;&#x2a;, &#x2a;&#x2a;, and &#x2a; represent significance at the levels of 1, 5, and 10%, respectively.</p>
</fn>
</table-wrap-foot>
</table-wrap>
<p>In summary, for Asian countries, population density and economic activities significantly increase the connectedness of the COVID-19 pandemic network, which is consistent with the full sample results. As most Asian countries have large populations and high residential density, it is very important and influential for them to decrease economic activities and strengthen quarantine measures appropriately. In addition, more substantial imports would reduce the connectedness of the COVID-19 pandemic network in Asian countries. We suspect that one of the reasons is that most Asian countries&#x2019; medical level is still relatively low. More imports of materials and medical equipment can effectively reduce domestic resource pressure, thus reducing connectedness.</p>
<p>
<xref ref-type="table" rid="T4">Table 4</xref> shows the empirical results for Europe. In Europe, the coefficients of Expense for degree, eigenvector, closeness, harmonic closeness, and page rank are significantly positive at 10 or 5%, meaning that government expenses in Europe may be a burden and that governments do not effectively use their resources to control the COVID-19 pandemic. The estimated coefficients of inflation for all characteristics are all significantly negative except for betweenness and page rank. All the estimated coefficients of Life are significantly negative at 10 or 5%, indicating that as countries with higher life expectancy are more likely to have a better medical level; life expectancy is negatively associated with the connectedness of the COVID-19 pandemic network.</p>
<table-wrap id="T4" position="float">
<label>TABLE 4</label>
<caption>
<p>Determinants of connectedness: Europe.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th rowspan="2" align="left">Variables</th>
<th align="center">(1)</th>
<th align="center">(2)</th>
<th align="center">(3)</th>
<th align="center">(4)</th>
<th align="center">(5)</th>
<th align="center">(6)</th>
<th align="center">(7)</th>
<th align="center">(8)</th>
<th align="center">(9)</th>
</tr>
<tr>
<th align="center">Degree</th>
<th align="center">Eigen</th>
<th align="center">Betweenness</th>
<th align="center">Closeness</th>
<th align="center">Harmonic</th>
<th align="center">Page rank</th>
<th align="center">Authority</th>
<th align="center">Hub</th>
<th align="center">Triangles</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">LnDensity</td>
<td align="center">0.9020</td>
<td align="center">0.0689</td>
<td align="center">28.5923</td>
<td align="center">0.0345</td>
<td align="center">0.0392</td>
<td align="center">0.0007</td>
<td align="center">0.0157</td>
<td align="center">0.0157</td>
<td align="center">3.5322</td>
</tr>
<tr>
<td align="left"/>
<td align="center">(0.60)</td>
<td align="center">(0.89)</td>
<td align="center">(0.72)</td>
<td align="center">(1.67)</td>
<td align="center">(1.68)</td>
<td align="center">(0.69)</td>
<td align="center">(0.87)</td>
<td align="center">(0.87)</td>
<td align="center">(0.74)</td>
</tr>
<tr>
<td align="left">LnGDP</td>
<td align="center">0.2223</td>
<td align="center">0.0478</td>
<td align="center">60.4216</td>
<td align="center">0.0681</td>
<td align="center">0.0740</td>
<td align="center">0.0009</td>
<td align="center">0.0140</td>
<td align="center">0.0140</td>
<td align="center">&#x2212;0.1817</td>
</tr>
<tr>
<td align="left"/>
<td align="center">(0.09)</td>
<td align="center">(0.36)</td>
<td align="center">(0.73)</td>
<td align="center">(1.37)</td>
<td align="center">(1.39)</td>
<td align="center">(0.56)</td>
<td align="center">(0.45)</td>
<td align="center">(0.45)</td>
<td align="center">(&#x2212;0.02)</td>
</tr>
<tr>
<td align="left">LnExport</td>
<td align="center">0.5186</td>
<td align="center">0.1156</td>
<td align="center">12.5290</td>
<td align="center">0.0634</td>
<td align="center">0.0832</td>
<td align="center">&#x2212;0.0007</td>
<td align="center">0.0137</td>
<td align="center">0.0137</td>
<td align="center">&#x2212;7.0843</td>
</tr>
<tr>
<td align="left"/>
<td align="center">(0.07)</td>
<td align="center">(0.30)</td>
<td align="center">(0.06)</td>
<td align="center">(0.89)</td>
<td align="center">(0.95)</td>
<td align="center">(&#x2212;0.14)</td>
<td align="center">(0.15)</td>
<td align="center">(0.15)</td>
<td align="center">(&#x2212;0.28)</td>
</tr>
<tr>
<td align="left">LnImport</td>
<td align="center">&#x2212;2.1137</td>
<td align="center">&#x2212;0.2598</td>
<td align="center">&#x2212;113.1319</td>
<td align="center">&#x2212;0.1503</td>
<td align="center">&#x2212;0.1819</td>
<td align="center">&#x2212;0.0010</td>
<td align="center">&#x2212;0.0503</td>
<td align="center">&#x2212;0.0503</td>
<td align="center">2.1277</td>
</tr>
<tr>
<td align="left"/>
<td align="center">(&#x2212;0.21)</td>
<td align="center">(&#x2212;0.49)</td>
<td align="center">(&#x2212;0.36)</td>
<td align="center">(&#x2212;1.25)</td>
<td align="center">(&#x2212;1.30)</td>
<td align="center">(&#x2212;0.14)</td>
<td align="center">(&#x2212;0.41)</td>
<td align="center">(&#x2212;0.41)</td>
<td align="center">(0.06)</td>
</tr>
<tr>
<td align="left">Inflation</td>
<td align="center">&#x2212;1.0538&#x2a;&#x2a;</td>
<td align="center">&#x2212;0.0673&#x2a;&#x2a;&#x2a;</td>
<td align="center">&#x2212;25.0360&#x2a;</td>
<td align="center">&#x2212;0.0101&#x2a;&#x2a;</td>
<td align="center">&#x2212;0.0120&#x2a;&#x2a;</td>
<td align="center">&#x2212;0.0007&#x2a;&#x2a;</td>
<td align="center">&#x2212;0.0168&#x2a;&#x2a;&#x2a;</td>
<td align="center">&#x2212;0.0168&#x2a;&#x2a;&#x2a;</td>
<td align="center">&#x2212;4.0368&#x2a;&#x2a;</td>
</tr>
<tr>
<td align="left"/>
<td align="center">(&#x2212;2.37)</td>
<td align="center">(&#x2212;2.85)</td>
<td align="center">(&#x2212;1.85)</td>
<td align="center">(&#x2212;2.22)</td>
<td align="center">(&#x2212;2.15)</td>
<td align="center">(&#x2212;2.26)</td>
<td align="center">(&#x2212;3.01)</td>
<td align="center">(&#x2212;3.01)</td>
<td align="center">(&#x2212;2.49)</td>
</tr>
<tr>
<td align="left">Expense</td>
<td align="center">0.2490&#x2a;&#x2a;</td>
<td align="center">0.0105&#x2a;</td>
<td align="center">6.4767</td>
<td align="center">0.0034&#x2a;</td>
<td align="center">0.0045&#x2a;&#x2a;</td>
<td align="center">0.0002&#x2a;&#x2a;</td>
<td align="center">0.0023</td>
<td align="center">0.0023</td>
<td align="center">0.6057&#x2a;</td>
</tr>
<tr>
<td align="left"/>
<td align="center">(2.26)</td>
<td align="center">(1.83)</td>
<td align="center">(1.54)</td>
<td align="center">(1.99)</td>
<td align="center">(2.37)</td>
<td align="center">(2.60)</td>
<td align="center">(1.69)</td>
<td align="center">(1.69)</td>
<td align="center">(1.73)</td>
</tr>
<tr>
<td align="left">Life</td>
<td align="center">&#x2212;0.5094&#x2a;</td>
<td align="center">&#x2212;0.0381&#x2a;&#x2a;</td>
<td align="center">&#x2212;8.2352</td>
<td align="center">&#x2212;0.0066&#x2a;&#x2a;</td>
<td align="center">&#x2212;0.0073&#x2a;&#x2a;</td>
<td align="center">&#x2212;0.0003</td>
<td align="center">&#x2212;0.0088&#x2a;&#x2a;</td>
<td align="center">&#x2212;0.0088&#x2a;&#x2a;</td>
<td align="center">&#x2212;1.7204&#x2a;</td>
</tr>
<tr>
<td align="left"/>
<td align="center">(&#x2212;1.90)</td>
<td align="center">(&#x2212;2.62)</td>
<td align="center">(&#x2212;1.06)</td>
<td align="center">(&#x2212;2.61)</td>
<td align="center">(&#x2212;2.34)</td>
<td align="center">(&#x2212;1.48)</td>
<td align="center">(&#x2212;2.57)</td>
<td align="center">(&#x2212;2.57)</td>
<td align="center">(&#x2212;1.77)</td>
</tr>
<tr>
<td align="left">Constant</td>
<td align="center">62.6958&#x2a;&#x2a;</td>
<td align="center">4.5161&#x2a;&#x2a;&#x2a;</td>
<td align="center">1,092.8542</td>
<td align="center">0.9114&#x2a;&#x2a;&#x2a;</td>
<td align="center">1.0772&#x2a;&#x2a;&#x2a;</td>
<td align="center">0.0359&#x2a;&#x2a;</td>
<td align="center">1.0523&#x2a;&#x2a;&#x2a;</td>
<td align="center">1.0523&#x2a;&#x2a;&#x2a;</td>
<td align="center">217.3826&#x2a;&#x2a;</td>
</tr>
<tr>
<td align="left"/>
<td align="center">(2.78)</td>
<td align="center">(3.93)</td>
<td align="center">(1.45)</td>
<td align="center">(4.58)</td>
<td align="center">(4.53)</td>
<td align="center">(2.30)</td>
<td align="center">(3.94)</td>
<td align="center">(3.94)</td>
<td align="center">(2.71)</td>
</tr>
<tr>
<td align="left">Observations</td>
<td align="center">33</td>
<td align="center">33</td>
<td align="center">33</td>
<td align="center">33</td>
<td align="center">33</td>
<td align="center">33</td>
<td align="center">33</td>
<td align="center">33</td>
<td align="center">33</td>
</tr>
<tr>
<td align="left">R-squared</td>
<td align="center">0.326</td>
<td align="center">0.398</td>
<td align="center">0.232</td>
<td align="center">0.301</td>
<td align="center">0.335</td>
<td align="center">0.330</td>
<td align="center">0.410</td>
<td align="center">0.410</td>
<td align="center">0.409</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<fn>
<p>Note: This table constructs regression models for the determinants of connectedness in Europe. Dependent variables are network connectedness characteristics. Independent variables are economic and social factors. Values in parentheses are the T statistical values; &#x2a;&#x2a;&#x2a;, &#x2a;&#x2a;, and &#x2a; indicate significance at the levels of 1, 5, and 10%, respectively.</p>
</fn>
</table-wrap-foot>
</table-wrap>
<p>Compared with Asian countries, economic activity, population density, and government expenditure do not significantly increase the connectedness of the COVID-19 pandemic network in Europe. However, life expectancy can effectively reduce network connections. As European countries have more capital intensive and high value-added industries compared with Asia, the infection possibility of COVID-19 is relatively low in those industries. We believe that cutting down economic activities can not effectively prevent and control the spread of COVID-19 pandemic in Europe. Moreover, as the population density in Europe is much lower than that in Asia, it is difficult for the government of European countries to lower their population density furthermore. Therefore, population density is not significantly associated with the connectedness of the COVID-19 pandemic in Europe. Compared with Asian countries, most European countries have a higher economic development level, so their government expenditure is generally used for medical expenditure. Government expenditure can effectively strengthen a country&#x2019;s medical resources. Therefore, life expectancy in Europe is higher, and life expectancy is negatively associated with the connectedness of the COVID-19 network, suggesting that the European medical level is useful for preventing and controlling COVID-19.</p>
<p>Due to differences in economic and social characteristics, policymakers should use different prevention and control measures for different countries. Each country should implement prevention policy measures according to its local conditions. Only in this way can we effectively control the further spread of COVID-19.</p>
</sec>
</sec>
<sec sec-type="conclusion" id="s6">
<title>Conclusion</title>
<p>Based on the growth pattern of the number of COVID-19 infections worldwide, this study constructed a complex network among 122 countries. Complex network analysis was used to deconstruct the overall connectedness of COVID-19 infection networks, visualize the connectedness characteristics among countries in the network, and further explore the influencing factors of the global COVID-19 infection network based on macrodata such as the economy, population, and life expectancy.</p>
<p>Our research shows that, first, in terms of overall connectedness, the global COVID-19 pandemic network has small-world network, close-world network, and community structure features. There are a total of 958 edges in 122 countries worldwide, which are divided into ten communities. This network has a small average path length (3.14) and a high clustering coefficient (0.58), and its diameter is 8. Second, in terms of intercountry connectedness, some countries have a significant influence on the global COVID-19 pandemic network, such as Austria (Europe), Croatia (Europe), Moldova (Europe), Brazil (South America), Canada (North America), Iran (Asia), Kazakhstan (Asia), Uzbekistan (Asia), Republic of the Congo (Africa), and Austria (Oceania). More attention should be paid to these countries for further control of COVID-19.</p>
<p>In addition, we divide the network into ten communities. The United States, Russia, and Colombia, which are suffering more severely from COVID-19, are in a community, while China and Japan, which have better control of COVID-19, are in another community.</p>
<p>Finally, in the influencing factor analysis, our study finds that population density, economic size, exports, and government expenditure significantly increased the connectedness of the COVID-19 infection network. However, imports and life expectancy significantly reduced the connectedness of the COVID-19 infection network. This result indicates that countries with large economic size, high population density, and high government expenditure more easily suffer from and spread COVID-19. In contrast, countries with adequate import capacity and a better medical level can reduce the network connectedness.</p>
</sec>
<sec id="s7">
<title>Data Availability Statement</title>
<p>The original contributions presented in the study are included in the article/Supplementary Material; further inquiries can be directed to the corresponding authors.</p>
</sec>
<sec id="s8">
<title>Author Contributions</title>
<p>SZ performed the coding, data analysis, and original draft. MK gave formal writing-review and editing. FL proposed the conceptualization and methodology and modified final draft. QF performed the funding acquisition, original draft preparation, and data preparation. GD performed the data collection and original arrangement.</p>
</sec>
<sec id="s9">
<title>Funding</title>
<p>This study was funded by the Scientific Research Fund Project of Yunnan Education Department (No.2021J0586), the Fundamental Research Funds for the Central Universities. (No.20wkpy85), and the China Postdoctoral Science Foundation (No. 2019M663356).</p>
</sec>
<sec id="s10" sec-type="COI-statement">
<title>Conflict of Interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
</body>
<back>
<ref-list>
<title>References</title>
<ref id="B1">
<label>1.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Moore</surname>
<given-names>C</given-names>
</name>
<name>
<surname>Newman</surname>
<given-names>ME</given-names>
</name>
</person-group>. <article-title>Epidemics and percolation in small-world networks</article-title>. <source>Phys Rev E Stat Phys Plasmas Fluids Relat Interdiscip Topics</source> (<year>2000</year>) <volume>61</volume>(<issue>5</issue>):<fpage>5678</fpage>&#x2013;<lpage>82</lpage>. <pub-id pub-id-type="doi">10.1103/physreve.61.5678</pub-id> </citation>
</ref>
<ref id="B2">
<label>2.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Stegehuis</surname>
<given-names>C</given-names>
</name>
<name>
<surname>Van Der Hofstad</surname>
<given-names>R</given-names>
</name>
<name>
<surname>Van Leeuwaarden</surname>
<given-names>JS</given-names>
</name>
</person-group>. <article-title>Epidemic spreading on complex networks with community structures</article-title>. <source>Sci Rep</source> (<year>2016</year>) <volume>6</volume>(<issue>1</issue>):<fpage>29748</fpage>&#x2013;<lpage>7</lpage>. <pub-id pub-id-type="doi">10.1038/srep29748</pub-id> </citation>
</ref>
<ref id="B3">
<label>3.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>J</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>C</given-names>
</name>
<name>
<surname>Xia</surname>
<given-names>C</given-names>
</name>
</person-group>. <article-title>Improved centrality indicators to characterize the nodal spreading capability in complex networks</article-title>. <source>Appl Math Comput</source> (<year>2018</year>) <volume>334</volume>:<fpage>388</fpage>&#x2013;<lpage>400</lpage>. <pub-id pub-id-type="doi">10.1016/j.amc.2018.04.028</pub-id> </citation>
</ref>
<ref id="B4">
<label>4.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>Z</given-names>
</name>
<name>
<surname>Xia</surname>
<given-names>C</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>Z</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>G</given-names>
</name>
</person-group>. <article-title>Epidemic propagation with positive and negative preventive information in multiplex networks</article-title>. <source>IEEE Trans Cybern</source> (<year>2020</year>) [<comment>Epub ahead of print</comment>]. <pub-id pub-id-type="doi">10.1109/TCYB.2019.2960605</pub-id> </citation>
</ref>
<ref id="B5">
<label>5.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Pastor-Satorras</surname>
<given-names>R</given-names>
</name>
<name>
<surname>Castellano</surname>
<given-names>C</given-names>
</name>
<name>
<surname>Van Mieghem</surname>
<given-names>P</given-names>
</name>
<name>
<surname>Vespignani</surname>
<given-names>A</given-names>
</name>
</person-group>. <article-title>Epidemic processes in complex networks</article-title>. <source>Rev Mod Phys</source> (<year>2015</year>) <volume>87</volume>(<issue>3</issue>):<fpage>925</fpage>. <pub-id pub-id-type="doi">10.1103/RevModPhys.87.925</pub-id> </citation>
</ref>
<ref id="B6">
<label>6.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Perc</surname>
<given-names>M</given-names>
</name>
<name>
<surname>Gori&#x161;ek Miksi&#x107;</surname>
<given-names>N</given-names>
</name>
<name>
<surname>Slavinec</surname>
<given-names>M</given-names>
</name>
<name>
<surname>Sto&#x17e;er</surname>
<given-names>A</given-names>
</name>
</person-group>. <article-title>Forecasting Covid-19</article-title>. <source>Front Phys</source> (<year>2020</year>) <volume>8</volume>:<fpage>127</fpage>. <pub-id pub-id-type="doi">10.3389/fphy.2020.00127</pub-id> </citation>
</ref>
<ref id="B7">
<label>7.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>C</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>X</given-names>
</name>
<name>
<surname>Niu</surname>
<given-names>R</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>X</given-names>
</name>
<name>
<surname>Fan</surname>
<given-names>R</given-names>
</name>
</person-group>. <article-title>A new SAIR model on complex networks for analysing the 2019 novel coronavirus (COVID-19)</article-title>. <source>Nonlinear Dynam</source> (<year>2020</year>) <fpage>1</fpage>&#x2013;<lpage>11</lpage>. <pub-id pub-id-type="doi">10.1007/s11071-020-05704-5</pub-id> </citation>
</ref>
<ref id="B8">
<label>8.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kraemer</surname>
<given-names>MUG</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>CH</given-names>
</name>
<name>
<surname>Gutierrez</surname>
<given-names>B</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>CH</given-names>
</name>
<name>
<surname>Klein</surname>
<given-names>B</given-names>
</name>
<name>
<surname>Pigott</surname>
<given-names>DM</given-names>
</name>
<etal/>
</person-group> <article-title>The effect of human mobility and control measures on the COVID-19 epidemic in China</article-title>. <source>Science</source> (<year>2020</year>) <volume>368</volume>(<issue>6490</issue>):<fpage>493</fpage>&#x2013;<lpage>7</lpage>. <pub-id pub-id-type="doi">10.1126/science.abb4218</pub-id> </citation>
</ref>
<ref id="B9">
<label>9.</label>
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Tsiotas</surname>
<given-names>D</given-names>
</name>
<name>
<surname>Magafas</surname>
<given-names>L</given-names>
</name>
</person-group>. <source>The effect of anti-COVID-19 policies to the evolution of the disease: a complex network analysis to the successful case of Greece</source> (<year>2020</year>) <comment>arXiv preprint arXiv:2004.06536</comment>. </citation>
</ref>
<ref id="B10">
<label>10.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Watts</surname>
<given-names>DJ</given-names>
</name>
<name>
<surname>Strogatz</surname>
<given-names>SH</given-names>
</name>
</person-group>. <article-title>Collective dynamics of &#x2018;small-world&#x2019; networks</article-title>. <source>Nature</source> (<year>1998</year>) <volume>393</volume>(<issue>6684</issue>):<fpage>440</fpage>&#x2013;<lpage>2</lpage>. <pub-id pub-id-type="doi">10.1038/30918</pub-id> </citation>
</ref>
<ref id="B11">
<label>11.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Pastor-Satorras</surname>
<given-names>R</given-names>
</name>
<name>
<surname>Vespignani</surname>
<given-names>A</given-names>
</name>
</person-group>. <article-title>Epidemic spreading in scale-free networks</article-title>. <source>Phys Rev Lett</source> (<year>2001</year>) <volume>86</volume>(<issue>14</issue>):<fpage>3200</fpage>&#x2013;<lpage>3</lpage>. <pub-id pub-id-type="doi">10.1103/PhysRevLett.86.3200</pub-id> </citation>
</ref>
<ref id="B12">
<label>12.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Newman</surname>
<given-names>ME</given-names>
</name>
</person-group>. <article-title>Communities, modules and large-scale structure in networks</article-title>. <source>Nat Phys</source> (<year>2012</year>) <volume>8</volume>(<issue>1</issue>):<fpage>25</fpage>&#x2013;<lpage>31</lpage>. <pub-id pub-id-type="doi">10.1038/nphys2162</pub-id> </citation>
</ref>
<ref id="B13">
<label>13.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>P</given-names>
</name>
<name>
<surname>Tian</surname>
<given-names>C</given-names>
</name>
<name>
<surname>Lu</surname>
<given-names>J-a</given-names>
</name>
</person-group>. <article-title>Identifying influential spreaders in artificial complex networks</article-title>. <source>J Syst Sci Complex</source> (<year>2014</year>) <volume>27</volume>(<issue>4</issue>):<fpage>650</fpage>&#x2013;<lpage>665</lpage>. <pub-id pub-id-type="doi">10.1007/s11424-014-2236-4</pub-id> </citation>
</ref>
<ref id="B14">
<label>14.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Estrada</surname>
<given-names>E</given-names>
</name>
<name>
<surname>Hatano</surname>
<given-names>N</given-names>
</name>
<name>
<surname>Benzi</surname>
<given-names>M</given-names>
</name>
</person-group>. <article-title>The physics of communicability in complex networks</article-title>. <source>Phys Rep</source> (<year>2012</year>) <volume>514</volume>(<issue>3</issue>):<fpage>89</fpage>&#x2013;<lpage>119</lpage>. <pub-id pub-id-type="doi">10.1016/j.physrep.2012.01.006</pub-id> </citation>
</ref>
<ref id="B15">
<label>15.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>Y-Y</given-names>
</name>
<name>
<surname>Barab&#xe1;si</surname>
<given-names>A-L</given-names>
</name>
</person-group>. <article-title>Control principles of complex systems</article-title>. <source>Rev Mod Phys</source> (<year>2016</year>) <volume>88</volume>(<issue>3</issue>):<fpage>035006</fpage>. <pub-id pub-id-type="doi">10.1103/RevModPhys.88.035006</pub-id> </citation>
</ref>
<ref id="B16">
<label>16.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liao</surname>
<given-names>H</given-names>
</name>
<name>
<surname>Mariani</surname>
<given-names>MS</given-names>
</name>
<name>
<surname>Medo</surname>
<given-names>M</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Y-C</given-names>
</name>
</person-group>. <article-title>Ranking in evolving complex networks</article-title>. <source>Phys Rep</source> (<year>2017</year>) <volume>689</volume>:<fpage>1</fpage>&#x2013;<lpage>54</lpage>. <pub-id pub-id-type="doi">10.1016/j.physrep.2017.05.001</pub-id> </citation>
</ref>
<ref id="B17">
<label>17.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hu</surname>
<given-names>J</given-names>
</name>
<name>
<surname>Chengyi</surname>
<given-names>X</given-names>
</name>
<name>
<surname>Huijia</surname>
<given-names>L</given-names>
</name>
<name>
<surname>Peican</surname>
<given-names>Z</given-names>
</name>
<name>
<surname>Wenjun</surname>
<given-names>X</given-names>
</name>
</person-group>. <article-title>Properties and structural analyses of USA&#x2019;s regional electricity market: a visibility graph network approach</article-title>. <source>Appl Math Comput</source> (<year>2020</year>) <volume>385</volume>:<fpage>125434</fpage>. <pub-id pub-id-type="doi">10.1016/j.amc.2020.125434</pub-id> </citation>
</ref>
<ref id="B18">
<label>18.</label>
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Ni</surname>
<given-names>S</given-names>
</name>
</person-group>. <source>Research on modeling of infectious disease spreading based on complex Network theory</source>. <publisher-loc>Beijing, China</publisher-loc>: <publisher-name>School of Aeronautics and Astronautics, Tsinghua University</publisher-name> (<year>2009</year>). </citation>
</ref>
<ref id="B19">
<label>19.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chen</surname>
<given-names>D</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>S</given-names>
</name>
<name>
<surname>Shang</surname>
<given-names>M</given-names>
</name>
</person-group>. <article-title>Complex network model and application in epidemic spreading and controlling</article-title>. <source>Comput Sci</source> (<year>2011</year>) <volume>38</volume>(<issue>6</issue>):<fpage>118</fpage>&#x2013;<lpage>21</lpage>. <pub-id pub-id-type="doi">10.3969/j.issn.1002-137X.2011.06.028</pub-id>
</citation>
</ref>
<ref id="B20">
<label>20.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Freeman</surname>
<given-names>LC</given-names>
</name>
</person-group>. <article-title>A set of measures of centrality based on betweenness</article-title>. <source>Sociometry</source> (<year>1977</year>) <volume>40</volume>:<fpage>35</fpage>&#x2013;<lpage>41</lpage>. <pub-id pub-id-type="doi">10.2307/3033543</pub-id> </citation>
</ref>
<ref id="B21">
<label>21.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sabidussi</surname>
<given-names>G</given-names>
</name>
</person-group>. <article-title>The centrality of a graph</article-title>. <source>Psychometrika</source> (<year>1966</year>) <volume>31</volume>(<issue>4</issue>):<fpage>581</fpage>&#x2013;<lpage>603</lpage>. <pub-id pub-id-type="doi">10.1007/BF02289527</pub-id> </citation>
</ref>
<ref id="B22">
<label>22.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bonacich</surname>
<given-names>P</given-names>
</name>
</person-group>. <article-title>Some unique properties of eigenvector centrality</article-title>. <source>Soc Network</source> (<year>2007</year>) <volume>29</volume>(<issue>4</issue>):<fpage>555</fpage>&#x2013;<lpage>64</lpage>. <pub-id pub-id-type="doi">10.1016/j.socnet.2007.04.002</pub-id> </citation>
</ref>
<ref id="B23">
<label>23.</label>
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Page</surname>
<given-names>L</given-names>
</name>
<name>
<surname>Brin</surname>
<given-names>S</given-names>
</name>
<name>
<surname>Motwani</surname>
<given-names>R</given-names>
</name>
<name>
<surname>Winograd</surname>
<given-names>T</given-names>
</name>
</person-group>. <article-title>The PageRank citation ranking: bringing order to the web</article-title>. <publisher-name>Stanford InfoLab</publisher-name> (<year>1999</year>) <volume>9</volume>(<issue>1</issue>):<fpage>1</fpage>&#x2013;<lpage>14</lpage>.</citation>
</ref>
<ref id="B24">
<label>24.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Barrat</surname>
<given-names>A</given-names>
</name>
<name>
<surname>Weigt</surname>
<given-names>M</given-names>
</name>
</person-group>. <article-title>On the properties of small-world network models</article-title>. <source>Eur Phys J B</source> (<year>2000</year>) <volume>13</volume>(<issue>3</issue>):<fpage>547</fpage>&#x2013;<lpage>60</lpage>. <pub-id pub-id-type="doi">10.1007/s100510050067</pub-id> </citation>
</ref>
<ref id="B25">
<label>25.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Watts</surname>
<given-names>DJ</given-names>
</name>
</person-group>. <article-title>Networks, dynamics, and the small-world phenomenon</article-title>. <source>Am J Sociol</source> (<year>1999</year>) <volume>105</volume>(<issue>2</issue>):<fpage>493</fpage>&#x2013;<lpage>527</lpage>. <pub-id pub-id-type="doi">10.1086/210318</pub-id>
</citation>
</ref>
<ref id="B26">
<label>26.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Newman</surname>
<given-names>ME</given-names>
</name>
</person-group>. <article-title>Fast algorithm for detecting community structure in networks</article-title>. <source>Phys Rev E Stat Nonlin Soft Matter Phys</source> (<year>2004</year>) <volume>69</volume>(<issue>6</issue>):<fpage>066133</fpage>. <pub-id pub-id-type="doi">10.1103/PhysRevE.69.066133</pub-id> </citation>
</ref>
<ref id="B27">
<label>27.</label>
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Newman</surname>
<given-names>MEJ</given-names>
</name>
</person-group>. <article-title>Modularity and community structure in networks</article-title>. <source>Proc Natl Acad Sci USA</source> (<year>2006</year>) <volume>103</volume>(<issue>23</issue>):<fpage>8577</fpage>&#x2013;<lpage>82</lpage>. <pub-id pub-id-type="doi">10.1073/pnas.0601602103</pub-id> </citation>
</ref>
</ref-list>
</back>
</article>