# Epidemic Spreading Characteristics and Immunity Measures Based on Complex Network with Contact Strength and Community Structure

Authors: Xueting Zhang; Bingfeng Ge; Qi Wang; Jiang Jiang; Hanlin You; Yingwu Chen
Journal: Mathematical Problems in Engineering
 (2015)

---

## Abstract

Middle East Respiratory Syndrome (MERS), bursting in South Korea from May 2015 and mainly spreading within the hospitals at the beginning, has caused a large scale of public panic. Aiming at this kind of epidemic spreading swiftly by intimate contact within community structure, we first established a spreading model based on contact strength and SI model, and a weighted network with community structure based on BBV network model. Meanwhile, the sufficient conditions were deduced to ensure the optimal community division. Next, after the verification by the real data of MERS, it is found that the spreading rate is closely related to the average weight of network but not the number of communities. Then, as the further study shows, the final infection proportion declines with the decreases both in isolation delay and in average weight; however, this proportion can only be postponed rather than decreased with respect to sole average weight reduction without isolation. Finally, the opportunities to take action can be found to restrain the epidemic spreading to the most extent.


---

## Body

## 1. Introduction

Middle East Respiratory Syndrome (MERS), first identified in Saudi Arabia in 2012, is a viral respiratory disease caused by a novel coronavirus. According to the World Health Organization (WHO), on May 14, 2013, there were 38 MERS cases, which grew further to 1150 after two years (i.e., May 31, 2015). For human-to-human transmission, the virus does not appear to pass easily from person to person unless they have close contact, such as providing unprotected care to or living together with infected patients.The epidemic status in South Korea from May 20, 2015, caused national public panic and worldwide attention. At the beginning, it spread evidently amongst the infectors and the patients in the same sickroom. This paper thus focuses on the spreading characteristics of intimate contact with community structure.Nowadays, the studies of epidemics spreading are twofold: the spreading model of differential equation and the complex network theory. There are three spreading models widely used in the study of virus transmission, namely, SIR model, SIS model, and SI model [1–4], and the solving algorithms are mainly based on percolation theory [5, 6], mean field theory [7, 8], and Markov chain theory [9, 10]. For the complex network, Erdös [11] proposed the random network, while Watts and Strogatz [12] presented the small world network model with smaller average shortest path length and bigger clustering coefficient. Barabási and Albert [13] put forward the scale-free network model with both adding points and preferential attachment. According to the real network, the connections in many networks are not merely binary entities (i.e., either present or not) but have associated weights that record their strengths relative to one another. Thus, Barrat et al. [14] created the BBV model where point weight and edge weight evolve dramatically.With the further study on the network topology, it is widely recognized that closely connected nodes and communities in social networks play an important role in topological properties and functional dynamics of involved complex networks [15, 16]. As a result, there are many community division algorithms and accuracy indices such as modularity [17–20]. Based on the aforementioned models, Liu and Hu [21] researched on the epidemic spreading through the network with small world effect by SIS model, while Smieszek et al. [22] studied that by SIR model. Salathé and Jones [23] focused on the influence of community structure to virus transmission. In order to know about the virus transmission mechanism better, the dynamic models endeavor to slow down the outbreak rate and control the spreading range. Many different immunization strategies are proposed, such as random immunization [1], target immunization [8], and acquaintance immunization [24].SI model is often applied to study on the epidemic dynamics at the early outbreak stages [25]. At the beginning, MERS in South Korea were mainly concentrated in three hospitals with obvious characteristics of community structure. In reality, the infection probability increases with the raise of contact time between infectious people and susceptible people, which must be highlighted in the epidemic spreading models. Edge weight is essential to describe the contact intimacy. In order to study the epidemic spreading characteristics and the optimal opportunity to take measures of MERS in South Korea, it is supposed that there is a linear relationship between contact strength and contact time. In this paper, spreading model is based on SI model with contact strength, and weighted network with community structure is based on BBV network model. The spreading characteristics are obtained by simulation according to the aforementioned models. Hence, they are verified by the real data in the South Korea MERS epidemic.The remainder of this paper is organized as follows. Section2 demonstrates the spreading model based on SI model in view of contact strength. Section 3 establishes the weighted network with community structure based on BBV model and analyzes the characteristics. Then, the spreading characteristics are studied to find the effective factors in Section 4, where the epidemic spreading process is divided into five stages. Section 5 studies the controlling measures (such as how to execute isolation and reduce the average weight of network) and the optimal opportunity to carry them out. Finally, case study based on MERS in South Korea is demonstrated in Section 6 to verify the models and the measure effects. Overall, both theoretical analysis and simulation results focus on the spreading characteristics and measure effects.


## 2. Epidemic Spreading Model

In this section, we suppose that the longer time the susceptible person contacts with the infectious ones, the larger probability the susceptible person will get infectious, at the beginning stage of the epidemic outbreak. In order to study the epidemic spreading process, we propose the spreading model based on contact strength and the computer simulation flowchart.


### 2.1. SI Model Based on Contact Strength

During the study of epidemic diffusion theory, the models are always based on some assumptions that the infectious unit is the node in the network and the epidemic can only spread through the links. The individuals are divided into 3 types:S (Susceptible) means the healthy state which is likely to be infectious, I (Infected) indicates the illness state which has already been infectious, and R (Removed) signifies the immune state which has always been recovered or dead.In terms of some epidemic bursting suddenly without valid control, such as SARS, H1N1 [26], and especially MERS, SI model is often used to study the spreading characteristics at the beginning period of diffusion process. Overall, prompt prevention measures would reduce the detrimental influence, which are of theoretical value and reality significance.When the contact strength to an infectious person isT1, the noninfectious probability of susceptible person is defined as (1)1-λT1/T0.Thus, when the contact strength to an infectious person isT0, the infectious probability of susceptible person is defined as(2)1-1-λT0/T0=λ.One susceptible person contacts an infectious person withT1 strength, then leaves for a while, and then contact the same infectious person with T3 strength. If he does not get infection at the first time, he would seem as a healthy susceptible person at the second moment. That is, the two contacts are independent, and the noninfectious probability of susceptible person after second contact is(3)1-λT2/T0·1-λT3/T0=1-λT2+T3/T0.If one susceptible point contacts two infectious points with strengthsT4 and T5, respectively, the noninfectious probability of susceptible person after two contacts is(4)1-λT4+T5/T0.For susceptible pointi, the infection probability λi is(5)λi=1-1-λ∑jTij/T0,where Tij indicates the edge strength between point i and infectious point j and ∑jTij means the sum of edge strength between point i and its adjacent infectious points.∑
j
T
i
j is defined as the average ∑jTij of each point in the whole network.When the whole network is stable, the ratio of susceptible points isst, and the ratio of infectious points is it, then(6)st+it=1,ditdt=1-1-λ∑jTj/T0it1-it.In the actual infection process, the longer time the susceptible person contacts the infectious person, the larger probability of susceptible person to get infection. In other words, the edge strength between them is magnified. In conclusion,Tij is a formula Tijt that depends on time t.For simplicity, it is assumed that there is a linear relationship betweenTijt and t:(7)Tijt=αij·t,where αij indicates the coefficient of contact strength, αij<1, α means the average αij, and k signifies the average point degree of network. Thus,(8)ditdt=1-1-λk·αt/T0it1-it,where a=1-λk·α/T0.The solution is(9)it=1i0-1-1e-t+ln-1a·at-1+1,where i0 is the ratio of infectious points at time 0, and when t→∞, it=1.


### 2.2. Simulation of Spreading Model

According to the above spreading model, the simulation flowchart is shown in Figure1.Figure 1
Flowchart of the spreading model simulation.In terms of susceptible pointi, the infectious probability λi is(10)λi=1-1-λ∑jαij·t-tsj/T0,where αij is the edge weight, tsj is the infected moment for point j and T0 and λ are the parameters related to the epidemic spreading characteristics.During the simulation process, the time step length is always the same asT0.Epidemic spreads in the human-to-human network. After the construction of the epidemic spreading model based on the contact among people, we need to construct the network model. Due to the characteristics of people social contact, the weighted network model with community structure is essential to be constructed.


## 2.1. SI Model Based on Contact Strength

During the study of epidemic diffusion theory, the models are always based on some assumptions that the infectious unit is the node in the network and the epidemic can only spread through the links. The individuals are divided into 3 types:S (Susceptible) means the healthy state which is likely to be infectious, I (Infected) indicates the illness state which has already been infectious, and R (Removed) signifies the immune state which has always been recovered or dead.In terms of some epidemic bursting suddenly without valid control, such as SARS, H1N1 [26], and especially MERS, SI model is often used to study the spreading characteristics at the beginning period of diffusion process. Overall, prompt prevention measures would reduce the detrimental influence, which are of theoretical value and reality significance.When the contact strength to an infectious person isT1, the noninfectious probability of susceptible person is defined as (1)1-λT1/T0.Thus, when the contact strength to an infectious person isT0, the infectious probability of susceptible person is defined as(2)1-1-λT0/T0=λ.One susceptible person contacts an infectious person withT1 strength, then leaves for a while, and then contact the same infectious person with T3 strength. If he does not get infection at the first time, he would seem as a healthy susceptible person at the second moment. That is, the two contacts are independent, and the noninfectious probability of susceptible person after second contact is(3)1-λT2/T0·1-λT3/T0=1-λT2+T3/T0.If one susceptible point contacts two infectious points with strengthsT4 and T5, respectively, the noninfectious probability of susceptible person after two contacts is(4)1-λT4+T5/T0.For susceptible pointi, the infection probability λi is(5)λi=1-1-λ∑jTij/T0,where Tij indicates the edge strength between point i and infectious point j and ∑jTij means the sum of edge strength between point i and its adjacent infectious points.∑
j
T
i
j is defined as the average ∑jTij of each point in the whole network.When the whole network is stable, the ratio of susceptible points isst, and the ratio of infectious points is it, then(6)st+it=1,ditdt=1-1-λ∑jTj/T0it1-it.In the actual infection process, the longer time the susceptible person contacts the infectious person, the larger probability of susceptible person to get infection. In other words, the edge strength between them is magnified. In conclusion,Tij is a formula Tijt that depends on time t.For simplicity, it is assumed that there is a linear relationship betweenTijt and t:(7)Tijt=αij·t,where αij indicates the coefficient of contact strength, αij<1, α means the average αij, and k signifies the average point degree of network. Thus,(8)ditdt=1-1-λk·αt/T0it1-it,where a=1-λk·α/T0.The solution is(9)it=1i0-1-1e-t+ln-1a·at-1+1,where i0 is the ratio of infectious points at time 0, and when t→∞, it=1.


## 2.2. Simulation of Spreading Model

According to the above spreading model, the simulation flowchart is shown in Figure1.Figure 1
Flowchart of the spreading model simulation.In terms of susceptible pointi, the infectious probability λi is(10)λi=1-1-λ∑jαij·t-tsj/T0,where αij is the edge weight, tsj is the infected moment for point j and T0 and λ are the parameters related to the epidemic spreading characteristics.During the simulation process, the time step length is always the same asT0.Epidemic spreads in the human-to-human network. After the construction of the epidemic spreading model based on the contact among people, we need to construct the network model. Due to the characteristics of people social contact, the weighted network model with community structure is essential to be constructed.


## 3. Network Model

This section establishes the weighted network with community structure and proposes the simulation process as the flowchart and then analyzes the sufficient conditions for the optimal community division. After that, the weight distribution and the community division characteristics are obtained [27].


### 3.1. Generation of Weighted Network with Community Structure

BBV network model is a weighted scale-free network model provided by Barrat et al. [14], which allows the dynamical evolution of weights during the growth of the system.It is assumed that pointi is within the community X, Ai indicates the strength of point i, AiI means the inner strength of point i, and AiO signifies the outer strength of point i; thus, (11)AiI=∑j∈Xαij,AiO=∑j∉Xαij,Ai=AiI+AiO,where αij means the edge weight between point i and point j; if i andj are disconnected, αij=0. If point i and point j are in the same community, it is called edge weight inner the community, while if they are in two different communities, it is called edge weight outer the community.Therefore, the evolution process of advanced BBV network is as follows.Step 1 (initial setup).
There areS communities (i.e., X1,X2,…,XS) contributing to network G. The initial community has mr0 nodes (all mr0 are the same as m), connected by a small quantity of edges. And different communities are connected by several edges (without the inner links of points in the community), which constitutes the initial network. All initial edge weights are α0.Step 2 (adding points).
Add a new pointi in each time step, and choose an arbitrary community (assumed as Xr) to join in. The new adding point is linked to the existing mrmr≤mr0 points in the community as the probability prIj (as shown in formula (1)) and linked to the existing nn<∑sms0 points out of the community as the probability prOk (as shown in formula (2)):(12)prIj=AjI∑j∈XrAjI,prOk=AkO∑k∈GAkO.Step 3 (weight change).
The new adding edge is endued with an initial weightα0, which leads to the weight change of the inner community of conjoint point j and the outer community of conjoint point k. The edge weights of the inner community are adapted to αjv=αjv+μIαjv/AiI (where i, j, and v are located at different communities), and the edge weights of the outer community are adapted to αkl=αkl+μOαkl/AkO (where i and k are located at different communities and k and l are located at different communities); μIand μO are the coefficients of weight enhancement.Step 4 (weight normalization).
After the construction of network, all the weights in the network are normalized. Assuming that the maximum edge weight of outer community isαmO, the maximum edge weight of inner community is αmI. Thus, the edge weights in the outer community of each point are normalized as αiO/αmO, and the edge weights in the inner community of each point are normalized as αiI/αmI.Similar to the BBV network model, each community forms a BBV network; whenS is big, all points in the whole network are connected to the edges out of the community to construct a BBV network. According to the mean filed theory [7, 8] and BBV network model [14], both the inner weight distribution and outer weight distribution of community are in accordance with the power law.According to the above four steps, the network meets all restrictions that are likely to be created as the simulation process of the weighted network with community structure in Figure2.Figure 2
Flowchart of network model generation.


### 3.2. Sufficient Conditions for Community Division

After the network generation, further research needs to analyze whether this kind of community division is the best. In this section, we study the sufficient condition to reach the optimal community division by analyses of modularity.Salathé and Jones [23] proposed the representation method of modularity Q in the weighted network:(13)Q=∑r=1Serr-hr2,where(14)err=12A∑i,j∈Xrαij,hr=12A∑i∈XrAi,A=12∑i,j∈Gαij.In the formula,A is the sum of all edge weights in network G; err is the proportion of the sum edge weight of community r occupying the edge weight sum of whole network; hr is the proportion of the sum point strength of community r taken up in the whole network.Then, it is essential to verify the former network model generated by four steps, where the modularity isQ0. Two communities Xr and Xs are chosen arbitrarily from the network, and then one point v in community Xs is assigned to community Xr. Thus, the network modularity changes to Q1, and the variation of modularity ΔQ is(15)ΔQ=Q0-Q1=err-hr2+ess-hs2-err′-hr′2+ess′-hs′2,q0=err-hr2+ess-hs2,q1=err′-hr′2+ess′-hs′2,q1=2A·err+2Av,rO2A-2A·hr+Av2A2+2A·ess-2AvI2A-2A·hs-Av2A2,ΔQ=q0-q1=AvIA-Av,rOA+2Av2A2+2hr-hsAv2A,where Av,rO is the sum edge weight of the adjacent edges between point v and inner points of community Xr, which names after the sum outer weight of community r of point v, recorded as maxrAv,rO.During the network generation, all communities are at the same level, but when the network scale is bigger, generally speaking,hr≈hs. Thus,(16)ΔQ≈AvIA-Av,rOA+2Av2A2.During the whole process, it is assured thatΔQ≥0.WhenAvI/A-Av,rO/A>0, it is known that ΔQ>2Av/2A2>0. Thus, if AvI>Av,rO, it is indubitable that the former community division methodology always gets the optimal result. If AvI>AvO (v is the arbitrary point), it is surely satisfied to the optimal restrictions. During the network construction period, all points need to be connected to more inner points of community with higher contact strength and fewer outer points of community with lower contact strength.After strict theoretical derivation and analyses, it is concluded that the sufficient condition to reach the optimal community division isAvI>Av,rO. Plenty of simulations should be done to analyze the characteristics.


### 3.3. Characteristics of the Network

#### 3.3.1. Characteristics of the Edge Weight

After the weighted networks with community structure are generated, the characteristics of network are studied further. It focuses on the relationship of four characteristics and the community amount, or the coefficient of weight growth, separately. The four characteristics are the inner weight distribution of community, the outer weight distribution of community, the average inner weight of community, and the average outer weight distribution of community.In Figure3, there are 5000 points: m=m0=3, n=S-1×m, and μI=μO=1.Figure 3
Relationship of weight distribution and the community amount.
(a)
The relationship of inner weight distribution of community and the community amount
(b)
The relationship of outer weight distribution of community and the community amountIt is demonstrated in Figure3 as log-log coordinate that the inner weight distributions of community obey the power law, which is pα~α-γ. In terms of the inner weight distribution of community, γ slightly increases with the rise of S; while in terms of the outer weight distribution of community, γ is generally high when S is large; anyway it is not strictly monotonous.In Figure4, there are 5000 points: S=100, m=m0=3, n=S-1×m, and μI=μO=μ. The less the value of μ is, the larger the value of γ is which related to the inner weight of the community or the outer weight of the community.Figure 4
Relationship of community weight distribution and the coefficient of weight growth.
(a)
Relationship of inner weight distribution of community and the coefficient of weight growth
(b)
Relationship of outer weight distribution of community and the coefficient of weight growthFigures3 and 4 demonstrate that every BBV network is isolated independently with different communities, because the inner weight distribution of each community obeys the law power. However, Figures 3(a) and 4(a) are both the statistical results of the inner weight within the community, and thus there is deviation between the simulation result and the power-law distribution.Supposing thatmeanαI indicates the mean of inner weighs, meanαO signifies the mean of outer weight.In Table1, there are 5000 points: S=100, m=m0=3, n=S-1×m, μI=μO=1.Table 1
Relationship of the average edge weight and the community amount.
S
50
100
150
200
250
MeanαI
0.111
0.182
0.206
0.216
0.238
MeanαO
0.062
0.089
0.097
0.145
0.135With the increase of the community amount, the average inner weights of community get higher. Compared to the network with fewer communities, the average outer weight of community is relatively higher when the community amount is larger.In Table2, there are 5000 points: S=100, m=m0=3, n=S-1×m, and μI=μO=μ.Table 2
Relationship of the average edge weights and the coefficient of weight growth.
μ
0.5
0.55
0.6
0.65
0.7
0.8
0.9
1.0
1.5
MeanαI
0.2806
0.2848
0.2885
0.2493
0.2519
0.2117
0.1846
0.1816
0.1067
MeanαO
0.1858
0.1929
0.1832
0.1431
0.1352
0.1206
0.1098
0.0894
0.0611It is demonstrated in Table2 that with the growth of μ, both the inner and the outer weight distributions of communities have the trend of decrease.After the simulation, it is concluded that the weight distributions obey the power law and satisfy the reality well. Moreover, the power-law distribution characteristics rely on the parameters obviously, hence by control of which, any type of networks can be built.


#### 3.3.2. Characteristics of the Community Structure

In this section, we will analyze the sufficient condition to satisfy the optimal community division and explain whether the network has a clear community structure by calculating the value of the modularity.In Figure5, there are 5000 points: S=100, m=m0=3, n=S-1×m, and μI=μO=1.Figure 5
Comparison graph ofAvI and maxrAv,rO.It is demonstrated thatAvI>maxrAv,rO, and each point meets the condition that AvI>Av,rO. In conclusion, the community division with this method is optimal.In Table3, there are 5000 points: S=100, m=m0=3, n=S-1×m, and μI=μO=1. And in Table 4, there are 5000 points: S=100, m=m0=3, n=S-1×m, and μI=μO=μ.Table 3
Relationship ofQ value and community amount.
S
50
100
150
200
250
Q
0.6439
0.6728
0.6950
0.6147
0.6640Table 4
Relationship ofQ value and the coefficient of weight growth.
μ
0.50
0.55
0.60
0.65
0.70
0.80
0.90
1.0
1.5
Q
0.6090
0.6054
0.6158
0.6376
0.6554
0.6358
0.6281
0.6728
0.6397In reality, the value range ofQ in the network with community is [0.3, 0.7], and it is demonstrated that there is obvious community structure in the network from Tables 3 and 4.


## 3.1. Generation of Weighted Network with Community Structure

BBV network model is a weighted scale-free network model provided by Barrat et al. [14], which allows the dynamical evolution of weights during the growth of the system.It is assumed that pointi is within the community X, Ai indicates the strength of point i, AiI means the inner strength of point i, and AiO signifies the outer strength of point i; thus, (11)AiI=∑j∈Xαij,AiO=∑j∉Xαij,Ai=AiI+AiO,where αij means the edge weight between point i and point j; if i andj are disconnected, αij=0. If point i and point j are in the same community, it is called edge weight inner the community, while if they are in two different communities, it is called edge weight outer the community.Therefore, the evolution process of advanced BBV network is as follows.Step 1 (initial setup).
There areS communities (i.e., X1,X2,…,XS) contributing to network G. The initial community has mr0 nodes (all mr0 are the same as m), connected by a small quantity of edges. And different communities are connected by several edges (without the inner links of points in the community), which constitutes the initial network. All initial edge weights are α0.Step 2 (adding points).
Add a new pointi in each time step, and choose an arbitrary community (assumed as Xr) to join in. The new adding point is linked to the existing mrmr≤mr0 points in the community as the probability prIj (as shown in formula (1)) and linked to the existing nn<∑sms0 points out of the community as the probability prOk (as shown in formula (2)):(12)prIj=AjI∑j∈XrAjI,prOk=AkO∑k∈GAkO.Step 3 (weight change).
The new adding edge is endued with an initial weightα0, which leads to the weight change of the inner community of conjoint point j and the outer community of conjoint point k. The edge weights of the inner community are adapted to αjv=αjv+μIαjv/AiI (where i, j, and v are located at different communities), and the edge weights of the outer community are adapted to αkl=αkl+μOαkl/AkO (where i and k are located at different communities and k and l are located at different communities); μIand μO are the coefficients of weight enhancement.Step 4 (weight normalization).
After the construction of network, all the weights in the network are normalized. Assuming that the maximum edge weight of outer community isαmO, the maximum edge weight of inner community is αmI. Thus, the edge weights in the outer community of each point are normalized as αiO/αmO, and the edge weights in the inner community of each point are normalized as αiI/αmI.Similar to the BBV network model, each community forms a BBV network; whenS is big, all points in the whole network are connected to the edges out of the community to construct a BBV network. According to the mean filed theory [7, 8] and BBV network model [14], both the inner weight distribution and outer weight distribution of community are in accordance with the power law.According to the above four steps, the network meets all restrictions that are likely to be created as the simulation process of the weighted network with community structure in Figure2.Figure 2
Flowchart of network model generation.


## 3.2. Sufficient Conditions for Community Division

After the network generation, further research needs to analyze whether this kind of community division is the best. In this section, we study the sufficient condition to reach the optimal community division by analyses of modularity.Salathé and Jones [23] proposed the representation method of modularity Q in the weighted network:(13)Q=∑r=1Serr-hr2,where(14)err=12A∑i,j∈Xrαij,hr=12A∑i∈XrAi,A=12∑i,j∈Gαij.In the formula,A is the sum of all edge weights in network G; err is the proportion of the sum edge weight of community r occupying the edge weight sum of whole network; hr is the proportion of the sum point strength of community r taken up in the whole network.Then, it is essential to verify the former network model generated by four steps, where the modularity isQ0. Two communities Xr and Xs are chosen arbitrarily from the network, and then one point v in community Xs is assigned to community Xr. Thus, the network modularity changes to Q1, and the variation of modularity ΔQ is(15)ΔQ=Q0-Q1=err-hr2+ess-hs2-err′-hr′2+ess′-hs′2,q0=err-hr2+ess-hs2,q1=err′-hr′2+ess′-hs′2,q1=2A·err+2Av,rO2A-2A·hr+Av2A2+2A·ess-2AvI2A-2A·hs-Av2A2,ΔQ=q0-q1=AvIA-Av,rOA+2Av2A2+2hr-hsAv2A,where Av,rO is the sum edge weight of the adjacent edges between point v and inner points of community Xr, which names after the sum outer weight of community r of point v, recorded as maxrAv,rO.During the network generation, all communities are at the same level, but when the network scale is bigger, generally speaking,hr≈hs. Thus,(16)ΔQ≈AvIA-Av,rOA+2Av2A2.During the whole process, it is assured thatΔQ≥0.WhenAvI/A-Av,rO/A>0, it is known that ΔQ>2Av/2A2>0. Thus, if AvI>Av,rO, it is indubitable that the former community division methodology always gets the optimal result. If AvI>AvO (v is the arbitrary point), it is surely satisfied to the optimal restrictions. During the network construction period, all points need to be connected to more inner points of community with higher contact strength and fewer outer points of community with lower contact strength.After strict theoretical derivation and analyses, it is concluded that the sufficient condition to reach the optimal community division isAvI>Av,rO. Plenty of simulations should be done to analyze the characteristics.


## 3.3. Characteristics of the Network

### 3.3.1. Characteristics of the Edge Weight

After the weighted networks with community structure are generated, the characteristics of network are studied further. It focuses on the relationship of four characteristics and the community amount, or the coefficient of weight growth, separately. The four characteristics are the inner weight distribution of community, the outer weight distribution of community, the average inner weight of community, and the average outer weight distribution of community.In Figure3, there are 5000 points: m=m0=3, n=S-1×m, and μI=μO=1.Figure 3
Relationship of weight distribution and the community amount.
(a)
The relationship of inner weight distribution of community and the community amount
(b)
The relationship of outer weight distribution of community and the community amountIt is demonstrated in Figure3 as log-log coordinate that the inner weight distributions of community obey the power law, which is pα~α-γ. In terms of the inner weight distribution of community, γ slightly increases with the rise of S; while in terms of the outer weight distribution of community, γ is generally high when S is large; anyway it is not strictly monotonous.In Figure4, there are 5000 points: S=100, m=m0=3, n=S-1×m, and μI=μO=μ. The less the value of μ is, the larger the value of γ is which related to the inner weight of the community or the outer weight of the community.Figure 4
Relationship of community weight distribution and the coefficient of weight growth.
(a)
Relationship of inner weight distribution of community and the coefficient of weight growth
(b)
Relationship of outer weight distribution of community and the coefficient of weight growthFigures3 and 4 demonstrate that every BBV network is isolated independently with different communities, because the inner weight distribution of each community obeys the law power. However, Figures 3(a) and 4(a) are both the statistical results of the inner weight within the community, and thus there is deviation between the simulation result and the power-law distribution.Supposing thatmeanαI indicates the mean of inner weighs, meanαO signifies the mean of outer weight.In Table1, there are 5000 points: S=100, m=m0=3, n=S-1×m, μI=μO=1.Table 1
Relationship of the average edge weight and the community amount.
S
50
100
150
200
250
MeanαI
0.111
0.182
0.206
0.216
0.238
MeanαO
0.062
0.089
0.097
0.145
0.135With the increase of the community amount, the average inner weights of community get higher. Compared to the network with fewer communities, the average outer weight of community is relatively higher when the community amount is larger.In Table2, there are 5000 points: S=100, m=m0=3, n=S-1×m, and μI=μO=μ.Table 2
Relationship of the average edge weights and the coefficient of weight growth.
μ
0.5
0.55
0.6
0.65
0.7
0.8
0.9
1.0
1.5
MeanαI
0.2806
0.2848
0.2885
0.2493
0.2519
0.2117
0.1846
0.1816
0.1067
MeanαO
0.1858
0.1929
0.1832
0.1431
0.1352
0.1206
0.1098
0.0894
0.0611It is demonstrated in Table2 that with the growth of μ, both the inner and the outer weight distributions of communities have the trend of decrease.After the simulation, it is concluded that the weight distributions obey the power law and satisfy the reality well. Moreover, the power-law distribution characteristics rely on the parameters obviously, hence by control of which, any type of networks can be built.


### 3.3.2. Characteristics of the Community Structure

In this section, we will analyze the sufficient condition to satisfy the optimal community division and explain whether the network has a clear community structure by calculating the value of the modularity.In Figure5, there are 5000 points: S=100, m=m0=3, n=S-1×m, and μI=μO=1.Figure 5
Comparison graph ofAvI and maxrAv,rO.It is demonstrated thatAvI>maxrAv,rO, and each point meets the condition that AvI>Av,rO. In conclusion, the community division with this method is optimal.In Table3, there are 5000 points: S=100, m=m0=3, n=S-1×m, and μI=μO=1. And in Table 4, there are 5000 points: S=100, m=m0=3, n=S-1×m, and μI=μO=μ.Table 3
Relationship ofQ value and community amount.
S
50
100
150
200
250
Q
0.6439
0.6728
0.6950
0.6147
0.6640Table 4
Relationship ofQ value and the coefficient of weight growth.
μ
0.50
0.55
0.60
0.65
0.70
0.80
0.90
1.0
1.5
Q
0.6090
0.6054
0.6158
0.6376
0.6554
0.6358
0.6281
0.6728
0.6397In reality, the value range ofQ in the network with community is [0.3, 0.7], and it is demonstrated that there is obvious community structure in the network from Tables 3 and 4.


## 3.3.1. Characteristics of the Edge Weight

After the weighted networks with community structure are generated, the characteristics of network are studied further. It focuses on the relationship of four characteristics and the community amount, or the coefficient of weight growth, separately. The four characteristics are the inner weight distribution of community, the outer weight distribution of community, the average inner weight of community, and the average outer weight distribution of community.In Figure3, there are 5000 points: m=m0=3, n=S-1×m, and μI=μO=1.Figure 3
Relationship of weight distribution and the community amount.
(a)
The relationship of inner weight distribution of community and the community amount
(b)
The relationship of outer weight distribution of community and the community amountIt is demonstrated in Figure3 as log-log coordinate that the inner weight distributions of community obey the power law, which is pα~α-γ. In terms of the inner weight distribution of community, γ slightly increases with the rise of S; while in terms of the outer weight distribution of community, γ is generally high when S is large; anyway it is not strictly monotonous.In Figure4, there are 5000 points: S=100, m=m0=3, n=S-1×m, and μI=μO=μ. The less the value of μ is, the larger the value of γ is which related to the inner weight of the community or the outer weight of the community.Figure 4
Relationship of community weight distribution and the coefficient of weight growth.
(a)
Relationship of inner weight distribution of community and the coefficient of weight growth
(b)
Relationship of outer weight distribution of community and the coefficient of weight growthFigures3 and 4 demonstrate that every BBV network is isolated independently with different communities, because the inner weight distribution of each community obeys the law power. However, Figures 3(a) and 4(a) are both the statistical results of the inner weight within the community, and thus there is deviation between the simulation result and the power-law distribution.Supposing thatmeanαI indicates the mean of inner weighs, meanαO signifies the mean of outer weight.In Table1, there are 5000 points: S=100, m=m0=3, n=S-1×m, μI=μO=1.Table 1
Relationship of the average edge weight and the community amount.
S
50
100
150
200
250
MeanαI
0.111
0.182
0.206
0.216
0.238
MeanαO
0.062
0.089
0.097
0.145
0.135With the increase of the community amount, the average inner weights of community get higher. Compared to the network with fewer communities, the average outer weight of community is relatively higher when the community amount is larger.In Table2, there are 5000 points: S=100, m=m0=3, n=S-1×m, and μI=μO=μ.Table 2
Relationship of the average edge weights and the coefficient of weight growth.
μ
0.5
0.55
0.6
0.65
0.7
0.8
0.9
1.0
1.5
MeanαI
0.2806
0.2848
0.2885
0.2493
0.2519
0.2117
0.1846
0.1816
0.1067
MeanαO
0.1858
0.1929
0.1832
0.1431
0.1352
0.1206
0.1098
0.0894
0.0611It is demonstrated in Table2 that with the growth of μ, both the inner and the outer weight distributions of communities have the trend of decrease.After the simulation, it is concluded that the weight distributions obey the power law and satisfy the reality well. Moreover, the power-law distribution characteristics rely on the parameters obviously, hence by control of which, any type of networks can be built.


## 3.3.2. Characteristics of the Community Structure

In this section, we will analyze the sufficient condition to satisfy the optimal community division and explain whether the network has a clear community structure by calculating the value of the modularity.In Figure5, there are 5000 points: S=100, m=m0=3, n=S-1×m, and μI=μO=1.Figure 5
Comparison graph ofAvI and maxrAv,rO.It is demonstrated thatAvI>maxrAv,rO, and each point meets the condition that AvI>Av,rO. In conclusion, the community division with this method is optimal.In Table3, there are 5000 points: S=100, m=m0=3, n=S-1×m, and μI=μO=1. And in Table 4, there are 5000 points: S=100, m=m0=3, n=S-1×m, and μI=μO=μ.Table 3
Relationship ofQ value and community amount.
S
50
100
150
200
250
Q
0.6439
0.6728
0.6950
0.6147
0.6640Table 4
Relationship ofQ value and the coefficient of weight growth.
μ
0.50
0.55
0.60
0.65
0.70
0.80
0.90
1.0
1.5
Q
0.6090
0.6054
0.6158
0.6376
0.6554
0.6358
0.6281
0.6728
0.6397In reality, the value range ofQ in the network with community is [0.3, 0.7], and it is demonstrated that there is obvious community structure in the network from Tables 3 and 4.


## 4. Characteristics of Epidemic Spreading

This section studies the specific characteristics of the epidemic spreading based on the aforementioned models, including the infection proportion of epidemic spreading in different stages, and the relationship of transmission rate and the community amount, or the average network weight, or the strength of the initial infectious point, separately.


### 4.1. Influence of Community Amount to Epidemic Spreading

It is defined that the epidemic transmission ratedη means the increase rate of the infection proportion. During the simulation process, the transmission rate φt is defined as the amount of new infectious points in each simulation time step.According to Figure6, in terms of the infection proportion variation curve for 200 communities, given 4 infection proportions, namely, ηt1, ηt2, ηt3, ηt4, we know that η0<ηt1<ηt2<ηt3<ηt4<η∞, corresponding to t1,t2,t3,t4(t1<t2<t3<t4), respectively. φt2 and φt3 are the transmission rate at t2 and t3, given φ1=minφt2,φt3, respectively. Therefore, the epidemic spreading process can be divided into 5 stages.Figure 6
Simulation graph of infection conditions with different community amounts.Stage 1 (the initial stage of spreading).
η
0
≤
η
t
<
η
t
1, where ηt is small, and the transmission rate is slow while the infection people are gathered in a small range.Stage 2 (the initial stage of outbreak).
η
t
1
≤
η
t
<
η
t
2, and the transmission rate increases constantly but φt<φt2.Stage 3 (the middle stage of outbreak).
η
t
2
≤
η
t
<
η
t
3, and the infection rate is larger than some value φt≥φ1.Stage 4 (the end stage of outbreak).
η
t
3
≤
η
t
<
η
t
4, and the transmission rate decreases constantly but φt<φt3.Stage 5 (the end stage of spreading).
η
t
>
η
t
4, the infection proportion is larger than some value, and at this stage, the whole network is nearly infectious.In comparison with the multiple simulations, the relationships between the infection proportion with different community amounts and the increase of time step length are shown in Figure6.In Figure6, there are 5000 points, while the average inner weights of community are normalized as 0.1, and the average outer weights of community are normalized as 0.05.The four curves are shown in Figure6, when the average weights are analogous, the four curves have similar variation trend at Stages 2 to 5, and these four stages are irrelative to the community amount without any control measurements. Compared to curves 2 and 4, it is found that there is randomness in the initial spreading stage related to the sum weight of initial infectious points.


### 4.2. Influence of the Average Weight to Epidemic Spreading

In Figure7, there are 5000 points and S=100.Figure 7
Relationship between the average weights and the infection proportion or the infection rate.
(a)
The relationship of the infection proportion and the average weights
(b)
The relationship of the infection rate and the average weightsThe later four stages are related to the average weight of the whole network, and the bigger the mean is, the larger the maximum infection proportion would be, and the transmission rate reaches the highest at the initial stage of outbreak. It is the middle stage of outbreak that the average weight has most effects on; therefore, reducing the weights in the network can postpone the outbreak to some extent.The parameters related to the infection ability affect the five stages. People barely have any effective measures to master the epidemic during the initial stage of spreading. This paper focuses on the control of large-scale epidemic spreading and the effective measures of nodes isolation and edge weights, although the impact of these parameters on epidemic spreading is not further studied in detail.


### 4.3. Influence of Initial Infection Strength to Epidemic Spreading

In Figure8, there are 5000 points, S=100, meanαI=0.1, and meanαO=0.05. It has been simulated 16 times when the strength of the initial infectious point is the maximum and another 16 times when the strength of the initial infectious point is the minimum.Figure 8
Relationship of infection proportion and the strength of initial infectious point.Figure8 shows that when the strength of initial infectious point is large, the continuous time at the first stage of epidemic spreading is shorter and more centralized after several times of simulation; when the strength of initial infectious point is small, the continuous time is longer and distributed more randomly.Through the simulation, it is concluded that the epidemic transmission rate has explicit relationship with the average weight of the network other than the community amount, especially at the later four stages of epidemic spreading. There is randomness at the first stage of epidemic spreading, while the larger the initial infectious point strength is, the less the randomness will be. Moreover, the first stage duration time is longer when the strength of the initial infectious point is less.


## 4.1. Influence of Community Amount to Epidemic Spreading

It is defined that the epidemic transmission ratedη means the increase rate of the infection proportion. During the simulation process, the transmission rate φt is defined as the amount of new infectious points in each simulation time step.According to Figure6, in terms of the infection proportion variation curve for 200 communities, given 4 infection proportions, namely, ηt1, ηt2, ηt3, ηt4, we know that η0<ηt1<ηt2<ηt3<ηt4<η∞, corresponding to t1,t2,t3,t4(t1<t2<t3<t4), respectively. φt2 and φt3 are the transmission rate at t2 and t3, given φ1=minφt2,φt3, respectively. Therefore, the epidemic spreading process can be divided into 5 stages.Figure 6
Simulation graph of infection conditions with different community amounts.Stage 1 (the initial stage of spreading).
η
0
≤
η
t
<
η
t
1, where ηt is small, and the transmission rate is slow while the infection people are gathered in a small range.Stage 2 (the initial stage of outbreak).
η
t
1
≤
η
t
<
η
t
2, and the transmission rate increases constantly but φt<φt2.Stage 3 (the middle stage of outbreak).
η
t
2
≤
η
t
<
η
t
3, and the infection rate is larger than some value φt≥φ1.Stage 4 (the end stage of outbreak).
η
t
3
≤
η
t
<
η
t
4, and the transmission rate decreases constantly but φt<φt3.Stage 5 (the end stage of spreading).
η
t
>
η
t
4, the infection proportion is larger than some value, and at this stage, the whole network is nearly infectious.In comparison with the multiple simulations, the relationships between the infection proportion with different community amounts and the increase of time step length are shown in Figure6.In Figure6, there are 5000 points, while the average inner weights of community are normalized as 0.1, and the average outer weights of community are normalized as 0.05.The four curves are shown in Figure6, when the average weights are analogous, the four curves have similar variation trend at Stages 2 to 5, and these four stages are irrelative to the community amount without any control measurements. Compared to curves 2 and 4, it is found that there is randomness in the initial spreading stage related to the sum weight of initial infectious points.


## 4.2. Influence of the Average Weight to Epidemic Spreading

In Figure7, there are 5000 points and S=100.Figure 7
Relationship between the average weights and the infection proportion or the infection rate.
(a)
The relationship of the infection proportion and the average weights
(b)
The relationship of the infection rate and the average weightsThe later four stages are related to the average weight of the whole network, and the bigger the mean is, the larger the maximum infection proportion would be, and the transmission rate reaches the highest at the initial stage of outbreak. It is the middle stage of outbreak that the average weight has most effects on; therefore, reducing the weights in the network can postpone the outbreak to some extent.The parameters related to the infection ability affect the five stages. People barely have any effective measures to master the epidemic during the initial stage of spreading. This paper focuses on the control of large-scale epidemic spreading and the effective measures of nodes isolation and edge weights, although the impact of these parameters on epidemic spreading is not further studied in detail.


## 4.3. Influence of Initial Infection Strength to Epidemic Spreading

In Figure8, there are 5000 points, S=100, meanαI=0.1, and meanαO=0.05. It has been simulated 16 times when the strength of the initial infectious point is the maximum and another 16 times when the strength of the initial infectious point is the minimum.Figure 8
Relationship of infection proportion and the strength of initial infectious point.Figure8 shows that when the strength of initial infectious point is large, the continuous time at the first stage of epidemic spreading is shorter and more centralized after several times of simulation; when the strength of initial infectious point is small, the continuous time is longer and distributed more randomly.Through the simulation, it is concluded that the epidemic transmission rate has explicit relationship with the average weight of the network other than the community amount, especially at the later four stages of epidemic spreading. There is randomness at the first stage of epidemic spreading, while the larger the initial infectious point strength is, the less the randomness will be. Moreover, the first stage duration time is longer when the strength of the initial infectious point is less.


## 5. Measures to Control Epidemic Spreading

### 5.1. Measures to Isolate the Infectious Points

In reality, at the very beginning of the epidemic spreading process, it is hard to attract the public attention due to the minority of infectors [28]. However, we hope to control the epidemic at the initial stage of epidemic outbreak. Assuming there is a constant parameter related to the infection ability, it is concluded after several simulations that(1)
from the initial stage of outbreak to the end stage of epidemic spreading, the infection proportion is stable around the valuei∞i∞≤1;(2)
the stablei∞i∞≤1 is related to t0 and λ.The simulation result is demonstrated as in Figure9. There are 5000 points, S=100, m=m0=3, n=S-1×m=6, μI=μO=1, T0=1, and λ=0.1. The amount of the initial infectious points is 10, and there are simulation curves at each t0.Figure 9
Relationship ofη and the step length with different t0.It is defined that the extreme isolation delayt0 is signed as mt0 which makes the final stable infection proportion i∞ satisfy i∞≤0.9, in terms of the infection probability λ at T0=1.In Table5, there are 5000 points, S=100, m=m0=3, n=S-1×m=6, and μI=μO=1.Table 5
The relationship ofmt0 and λ.
λ
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
m
t
0
16
11
9
8
7
6
5
4This section focuses on the influence of isolation delay on epidemic spreading and obtains that timely isolation can reduce the final infection proportioni∞, which indicates that there is direct relationship between i∞ and the isolation delay.


### 5.2. Measures to Reduce the Average Weight of Network

In reality, during the control process at the initial stage of the infectious epidemic, it exists infectivity for some viruses without any explicit symptoms [29]. Coupled with the isolation efficiency, it is difficult to put all infectious points isolated at the initial stage; in other words, it is hard to make t0 less. Accordingly, if only taking measurement as point isolation, the epidemic infection proportion i∞ eventually reaches a large value, which is not conducive to control the epidemic spreading.If the isolation measures are not taken in time, it is also required to control the whole network by other measures in order to better control the epidemic spreading. In reality, it is often acceptable that the healthy person should enhance the self-protection conscience and cut down the opportunities to contact with the infectious ones, which equals reducing the average weight of points and canceling some edges in the network model [30].Nowadays, the widely acceptable methods to control the whole network include keeping away from public places and minimizing direct contact with each other as much as possible [31, 32]. However, if measures are carried out too early or too much, it will change people’s living habits, increase the economic loss, and cause large-scale social panic, but if it is too late, it will lose the best opportunity to control the epidemic spreading.It is demonstrated in Figure7 that it can only postpone the epidemic outbreak other than cut down the final spreading proportion by reducing the average weight of the network. However, it is not useful to lessen the average weight of the network at Stage 1 (the initial stage of epidemic spreading) but to make point isolation. At Stage 2 (the initial stage of outbreak), if the isolation delay t0 cannot meet the requirements even when the infection proportion becomes i∞, it is essential to take measures to decrease the average weight of the network.Figure10 depicts the influence of different network average weights have on i∞ after the point isolation.Figure 10
Relationship of infection proportion and time step length after points isolation.In Figure10, there are 5000 points, S=100, m=m0=3, n=S-1×m=6, T0=1, λ=0.6, and t0=6. When the isolation measures are taken and the isolation delay t0 is constant, the less the average weight of the network is, the smaller the value of i∞ would be.In reality, once the epidemic breaks out, the isolation measures should be taken; then, we can analyze the characteristics of epidemic spreading by statistical method and study the isolation delay. It is necessary to take some measures to cut down the average weight of the network at Stage2 (the initial stage of outbreak). When it comes to Stage 3 (the middle stage of outbreak), it is essential to decrease the average weight of the network, in order to make it come into Stage 4 (the end stage of outbreak) and Stage 5 (the end stage of spreading) as soon as possible.


## 5.1. Measures to Isolate the Infectious Points

In reality, at the very beginning of the epidemic spreading process, it is hard to attract the public attention due to the minority of infectors [28]. However, we hope to control the epidemic at the initial stage of epidemic outbreak. Assuming there is a constant parameter related to the infection ability, it is concluded after several simulations that(1)
from the initial stage of outbreak to the end stage of epidemic spreading, the infection proportion is stable around the valuei∞i∞≤1;(2)
the stablei∞i∞≤1 is related to t0 and λ.The simulation result is demonstrated as in Figure9. There are 5000 points, S=100, m=m0=3, n=S-1×m=6, μI=μO=1, T0=1, and λ=0.1. The amount of the initial infectious points is 10, and there are simulation curves at each t0.Figure 9
Relationship ofη and the step length with different t0.It is defined that the extreme isolation delayt0 is signed as mt0 which makes the final stable infection proportion i∞ satisfy i∞≤0.9, in terms of the infection probability λ at T0=1.In Table5, there are 5000 points, S=100, m=m0=3, n=S-1×m=6, and μI=μO=1.Table 5
The relationship ofmt0 and λ.
λ
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
m
t
0
16
11
9
8
7
6
5
4This section focuses on the influence of isolation delay on epidemic spreading and obtains that timely isolation can reduce the final infection proportioni∞, which indicates that there is direct relationship between i∞ and the isolation delay.


## 5.2. Measures to Reduce the Average Weight of Network

In reality, during the control process at the initial stage of the infectious epidemic, it exists infectivity for some viruses without any explicit symptoms [29]. Coupled with the isolation efficiency, it is difficult to put all infectious points isolated at the initial stage; in other words, it is hard to make t0 less. Accordingly, if only taking measurement as point isolation, the epidemic infection proportion i∞ eventually reaches a large value, which is not conducive to control the epidemic spreading.If the isolation measures are not taken in time, it is also required to control the whole network by other measures in order to better control the epidemic spreading. In reality, it is often acceptable that the healthy person should enhance the self-protection conscience and cut down the opportunities to contact with the infectious ones, which equals reducing the average weight of points and canceling some edges in the network model [30].Nowadays, the widely acceptable methods to control the whole network include keeping away from public places and minimizing direct contact with each other as much as possible [31, 32]. However, if measures are carried out too early or too much, it will change people’s living habits, increase the economic loss, and cause large-scale social panic, but if it is too late, it will lose the best opportunity to control the epidemic spreading.It is demonstrated in Figure7 that it can only postpone the epidemic outbreak other than cut down the final spreading proportion by reducing the average weight of the network. However, it is not useful to lessen the average weight of the network at Stage 1 (the initial stage of epidemic spreading) but to make point isolation. At Stage 2 (the initial stage of outbreak), if the isolation delay t0 cannot meet the requirements even when the infection proportion becomes i∞, it is essential to take measures to decrease the average weight of the network.Figure10 depicts the influence of different network average weights have on i∞ after the point isolation.Figure 10
Relationship of infection proportion and time step length after points isolation.In Figure10, there are 5000 points, S=100, m=m0=3, n=S-1×m=6, T0=1, λ=0.6, and t0=6. When the isolation measures are taken and the isolation delay t0 is constant, the less the average weight of the network is, the smaller the value of i∞ would be.In reality, once the epidemic breaks out, the isolation measures should be taken; then, we can analyze the characteristics of epidemic spreading by statistical method and study the isolation delay. It is necessary to take some measures to cut down the average weight of the network at Stage2 (the initial stage of outbreak). When it comes to Stage 3 (the middle stage of outbreak), it is essential to decrease the average weight of the network, in order to make it come into Stage 4 (the end stage of outbreak) and Stage 5 (the end stage of spreading) as soon as possible.


## 6. Case Study on MERS

### 6.1. Case Study of Epidemic Spreading Characteristics

Epidemic spreading model based on contact strength was proposed in Section2, while weighted network model with community structure was proposed in Section 3. However, real data is essential to verify whether the epidemic spreading result based on this model is persuasive.From the first MERS infection case that was diagnosed definitely in South Korea, there have been 166 people infected until 20 June 2015. The change trend of infection population during these 31 days is shown in Figure11.Figure 11
Statistics of MERS infection population in South Korea.It is not until June 7th when the South Korea government actually issued a response to MERS; in consequence, the 19 days from May 20th to June 7th should be regarded as the initial stage of the epidemic outbreak without interference measures, and the infection population is 87. The epidemic in this period mainly occurred in 3 hospitals, namely, Pyongtaek Mary Hospital, Konyang University Hospital, and Daejeon Hospital. They are considered as 3 communities (S=3), and the sum of points is regarded as the total amount of contact points in epidemic spreading network with the three communities. Then the fitting result of the simulation data and the real-world data are demonstrated in Figure 12, where the infection proportion η means the ratio of infectious points in the total amount of points in the network.Figure 12
Fitting result of the simulation infection proportion and the real-world data.From May 20th to June 7th, the population is about 500–1000 in the contact network of the three hospitals. Hence, the simulation parameters in Figure12 are as follows: in terms of the network model, the total amount of points is 600, S=3, m=m0=3, n=S-1×m=6, μI=0.2, and μO=0.6; in terms of the epidemic spreading model, T0=2.4, λ=0.1, the initial amount of infectious points is 1. The real data curve is drawn by the MERS infectious population in South Korea divided into 600.Overall, due to the fitting result in Figure12, the real initial stage of epidemic outbreak can be explained well by the network model and the epidemic spreading model proposed in this paper.In this section, the accuracy of models in this paper is verified by comparison of the real data.


### 6.2. Case Study of Control Measures

Figure13 shows the comparison about the simulation result of infection proportion change with the increase of time step length and the real data after June 7th when the isolation measures were taken by South Korea government.Figure 13
Comparative graph of simulation result and real data after the measures.In Figure13, there are 600 points, S=3, m=m0=3, n=S-1×m=6, μI=0.2, and μO=0.6, and in the epidemic spreading model, T0=2.4, λ=0.1, the initial infection population is 1, and the isolation measure is taken at the 19th step, t0=4. The real data curve is drawn by the MERS infectious population divided into 600.It is demonstrated in Figure13 that the curve can fit the real infection proportion statistics curve when the isolation delay t0=4. However, the South Korea government took measure at Stage 2 (the initial stage of outbreak) actually, which was a little later. The simulation result is shown as in Figure 14 if the measures were taken at Stage 1 (the initial stage of epidemic spreading).Figure 14
Simulation result when the isolation measures are taken at Stage1.In Figure14, the network model and epidemic spreading model are the same as Figure 13, t0=4, but the isolation measure is taken at the first step. The 6 simulation result curves are the 6 results with maximum i∞ among the 100 times simulation.Figure14 demonstrates that if we could take measures at the very beginning of epidemic spreading, the final infection proportion i∞ would be reduced significantly even with the same isolation delay. However, due to the abruptness of epidemic outbreak, it is difficult to master control at the early stage. Consequently, it is essential to reduce the average weight of the network by some auxiliary measures, for example, dissolving some organizations with evident community structure (such as schools), decreasing the stay time in public places, or canceling some public activities.


## 6.1. Case Study of Epidemic Spreading Characteristics

Epidemic spreading model based on contact strength was proposed in Section2, while weighted network model with community structure was proposed in Section 3. However, real data is essential to verify whether the epidemic spreading result based on this model is persuasive.From the first MERS infection case that was diagnosed definitely in South Korea, there have been 166 people infected until 20 June 2015. The change trend of infection population during these 31 days is shown in Figure11.Figure 11
Statistics of MERS infection population in South Korea.It is not until June 7th when the South Korea government actually issued a response to MERS; in consequence, the 19 days from May 20th to June 7th should be regarded as the initial stage of the epidemic outbreak without interference measures, and the infection population is 87. The epidemic in this period mainly occurred in 3 hospitals, namely, Pyongtaek Mary Hospital, Konyang University Hospital, and Daejeon Hospital. They are considered as 3 communities (S=3), and the sum of points is regarded as the total amount of contact points in epidemic spreading network with the three communities. Then the fitting result of the simulation data and the real-world data are demonstrated in Figure 12, where the infection proportion η means the ratio of infectious points in the total amount of points in the network.Figure 12
Fitting result of the simulation infection proportion and the real-world data.From May 20th to June 7th, the population is about 500–1000 in the contact network of the three hospitals. Hence, the simulation parameters in Figure12 are as follows: in terms of the network model, the total amount of points is 600, S=3, m=m0=3, n=S-1×m=6, μI=0.2, and μO=0.6; in terms of the epidemic spreading model, T0=2.4, λ=0.1, the initial amount of infectious points is 1. The real data curve is drawn by the MERS infectious population in South Korea divided into 600.Overall, due to the fitting result in Figure12, the real initial stage of epidemic outbreak can be explained well by the network model and the epidemic spreading model proposed in this paper.In this section, the accuracy of models in this paper is verified by comparison of the real data.


## 6.2. Case Study of Control Measures

Figure13 shows the comparison about the simulation result of infection proportion change with the increase of time step length and the real data after June 7th when the isolation measures were taken by South Korea government.Figure 13
Comparative graph of simulation result and real data after the measures.In Figure13, there are 600 points, S=3, m=m0=3, n=S-1×m=6, μI=0.2, and μO=0.6, and in the epidemic spreading model, T0=2.4, λ=0.1, the initial infection population is 1, and the isolation measure is taken at the 19th step, t0=4. The real data curve is drawn by the MERS infectious population divided into 600.It is demonstrated in Figure13 that the curve can fit the real infection proportion statistics curve when the isolation delay t0=4. However, the South Korea government took measure at Stage 2 (the initial stage of outbreak) actually, which was a little later. The simulation result is shown as in Figure 14 if the measures were taken at Stage 1 (the initial stage of epidemic spreading).Figure 14
Simulation result when the isolation measures are taken at Stage1.In Figure14, the network model and epidemic spreading model are the same as Figure 13, t0=4, but the isolation measure is taken at the first step. The 6 simulation result curves are the 6 results with maximum i∞ among the 100 times simulation.Figure14 demonstrates that if we could take measures at the very beginning of epidemic spreading, the final infection proportion i∞ would be reduced significantly even with the same isolation delay. However, due to the abruptness of epidemic outbreak, it is difficult to master control at the early stage. Consequently, it is essential to reduce the average weight of the network by some auxiliary measures, for example, dissolving some organizations with evident community structure (such as schools), decreasing the stay time in public places, or canceling some public activities.


## 7. Conclusion

MERS viruses are spreading swiftly at the very beginning period among the intimate human-to-human contact communities. The control measurements and the optimal opportunity to take action are proposed to study the spreading characteristics. Assuming that the contact strength has a linear relationship with time, the epidemic spreading model is established based on the SI model, which is the foundation of analytical solution research. The weighted network model with community structure is constructed on the basis of the BBV network model, deducing that the generated network meets the sufficient conditions for the optimal community division. The simulation results show that the weight distributions within the community and among the communities both obey the power-law distribution.According to the epidemic spreading network model, this research focuses on the characteristics of virus transmission. Hence, the epidemic spreading process would be divided into five stages: the initial stage of spreading, the initial stage of outbreak, the middle stage of outbreak, the end stage of outbreak, and the end stage of spreading. Then the simulation results show that the duration time of Stage1 is related to the sum weight of the initial infection nodes, while those of Stages 2 to 5 are only related to the average weight instead of the community amount. However, without isolation measures, the decrease of the average weight only postpones spreading without interdicting it.There is always a time delay before patients are isolated; thus, we study on the effects and optimal opportunity to master the epidemic spreading by two approaches: the point isolation and the average weight of network reduction. In conclusion, shorter time delay would reduce the final infection proportion, and with the same time delay, the decline of the average weight would further reduce the final infection proportion. The simulation data matches the real data of MERS in South Korea well. Therefore, the measures are adopted as follows: firstly isolate the infectious points as soon as possible; if the infection proportion is higher than the setting threshold, then the average weight should be cut down to the corresponding value (e.g., canceling public activities, dissolving some organizations, and keeping away from the crowded places).The models in this paper are also appropriate for the diffusion of terrorist forces or evil forces with intimate community structures. Since the proposed epidemic spreading model is based on the SI model, it is hard to simulate the condition in which infectious people recover or die after a period of epidemic outbreak. Moreover, it is supposed that there is a linear relationship between contact strength and contact time, which cannot mimic the reality very well. In the future, we will study on different diseases with different epidemic spreading models on the proposed weighted network model with community structure after the period of large-scale infection or immunization.



---

*Source: 316092-2015-11-04.xml*