Research Article | Open Access

Jingjing Tian, Shuping Li, "Dynamics Modeling and Analysis of SIS Epidemic Spreading in Cluster Networks", *Discrete Dynamics in Nature and Society*, vol. 2019, Article ID 5450360, 8 pages, 2019. https://doi.org/10.1155/2019/5450360

# Dynamics Modeling and Analysis of SIS Epidemic Spreading in Cluster Networks

**Academic Editor:**Maria Alessandra Ragusa

#### Abstract

In this paper, we propose and study an SIS epidemic model with clustering characteristics based on networks. Using the method of the existence of positive equilibrium point, we obtain the formula of the basic reproduction number . Furthermore, by constructing Lyapunov function, we also prove that the disease-free equilibrium of the model is globally asymptotically stable when . When , there is only one positive equilibrium point which is globally asymptotically stable. It is also shown that the infection proportion and the basic reproduction number increases as the clustering coefficient increases when the average degree of networks is fixed.

#### 1. Introduction

A large number of complex systems in nature and human society can be described by complex networks. At present, the structure of complex networks and mathematical models based on networks in the field of biology and other fields has been deeply studied [1–3]. In the biological field, the spread of infectious diseases can affect people’s physical and mental health. The spread of infectious diseases is not only related to the transmission mechanisms of diseases, but also related to the topology of the complex network. A lot of researches have shown that two topologies of the network can profoundly affect the dynamics of infectious diseases: one is the degree distribution (the number distribution of contact neighbors per individual) [4–6]; the other is contact clusters (such as households or school) [7, 8]. The effect of degree distribution on the spread of diseases in networks has been widely discussed and fully understood [9, 10]. The results of these studies clearly show that the basic reproduction number of diseases tends to infinity when the variance of the degree distribution tends to infinity in scale-free networks. This means that the disease can easily spread in scale-free networks regardless of how fast the epidemic spreads [9].

Clustering in a complex network means that two neighboring nodes of a given node also have a tendency to become neighbors, so a triangle is formed in the network. In the contact network, these triangles called clusters mean that two friends of one person are also friends with each other. The clustering coefficient is an indicator for measuring the level of clustering in the network. The average value of the clustering coefficients of all nodes in the network is called the clustering coefficient of the network [11]. Generally, when the degree distribution is fixed, the number of network clusters (namely, the number of triangles) can significantly increase as the clustering coefficient of the network increases. Network clusters not only affect the network structure, but also affect the dynamics of the disease transmission on the network.

In the past decade, some researchers have used different methods to study the impact of clustering on the spread of epidemics in weak clustering networks. Eames [12] studied the spread of epidemics in random networks when the number of triangles is given. The results show that sufficient clustering can increase the epidemic threshold. However, at the small and moderate levels, clustering appears not to change the final size of epidemics significantly. Miller found that clusters reduced the basic reproduction number and the final scale of the epidemic in weak clustering networks [13, 14]. Trapman constructed a random graph when degree distribution and the expected number of triangles were given [15] and studied the effects of the degree distribution and the expected number of triangles on disease transmissions in the network. The results show that clusters reduce the basic reproduction number and the final size of the epidemic. Newman found that, when the average degree of weak clustering network is fixed, the basic reproduction number of diseases increases and the final scale of epidemics decreases as the clustering coefficient increases [11]. In 2011, Volz et al. took advantage of the method of dynamical probability generating function based nodes in weak clustering networks to find that clustering always slows the spread of the epidemic, but simultaneously increasing clustering and the variance of the degree distribution can increase the final infection scale [8]. Li proposed a new SIS model that includes network clusters. It is pointed out that, due to the heterogeneity of infection, clusters always promote the spread of diseases in the network [16].

In this paper, we establish an SIS dynamical model on a class of clustered networks to further study how degree distribution and clustering influence the spread of disease. In Section 2, considering the infectivity heterogeneity of infective nodes located at different sites (at the end of single edge or the edge in the triangle), we derive an SIS dynamical model based on the mean-field method describing the transmission of diseases in networks with arbitrary degree distributions and clustering coefficients. In Section 3, we calculate the reproduction number of diseases and prove the local and global stability of disease-free equilibrium and the endemic equilibrium. In Section 4, the impacts of degree distributions and clusters on disease in the network are analyzed by simulations. The results show that the reproduction number and the relation size of infection individual always increase as the clustering coefficient increases.

#### 2. Dynamic Modeling

We consider a class of weakly clustered network where there are no common edges between any two triangles. We assume that each node has some lines (or single edges) and triangles in the network. For convenience, we assume the numbers of lines and triangles of every node are independent. In the current clustered network, we consider that each individual exists only in two discrete states: S-susceptible and I-infected. At each time step, each susceptible (healthy) node is infected if it is contacted by one infected individual; at the same time, infected nodes are cured and become again susceptible with rate . Without lack of generality, we can set . It is worth noting that each susceptible node is infected by its infected neighbors which are connected by the line or edge in triangles. If a susceptible node is not infected, then it must be not infected by any of all infected neighbors to which it is connected, neither by lines nor by triangles. Let be the infection probability that a susceptible node is infected by the random edge in triangles and be the infection probability that a susceptible node is infected by a random infected neighbor connected by a line.

Let represents the total number of nodes in the network. and , respectively, represent the number of susceptible and infected persons with degree at time . represents the total number of nodes with degree and is a constant in the static network. It is obvious that the degree distribution is given by . Then, the average degree is given by . Let and . Obviously, . For three different nodes in the network, they are called an open triple, where is connected with and (see Figure 1(a)). If nodes and are also connected by an edge, the triple is called a closed triple or triangle (see Figure 1(b)).

**(a) Open triple**

**(b) Closed triple**

We denote as the number of triangles around a node of degree* k* and as the number of connected all triples (open triple and triangle) around a node of degree . The clustering coefficient of nodes with degree is defined by [17]. Then, the number of edges connected with the nodes of degree to the nodes in the triangle is . The number of lines around a node with degree is . In degree uncorrelated networks, is independent of and so local clustering coefficient is equal with global clustering coefficient () [17, 18]. Obviously, where is the probability that any given edge points to an infected node in the triangles and is the probability that any given link points to an infected node.

In degree uncorrelated networks, the dynamical mean-field (MF) reaction rate equations of disease transmission are established:Due to , then we can rewrite system (2) asObviously, in real life, the probability that a susceptible node is infected by an infected node in the family is greater than the probability that a susceptible node is infected by an infected stranger. So we assume that and . Let , where . Then, system (3) can be rewritten as

#### 3. Analysis of the Feasible Region

Lemma 1. *Suppose that the initial relative infected densities satisfy . Then, as , the solution of system (4) satisfies , .*

*Proof. *According to system (4), satisfies the following equation:For equation (5) from integral, we getSince , we havewhere .

System (4) can be rewritten asSince , we haveFor the above inequality from integral, we getOn the other hand, it can be verified that the function satisfies the equation For equation (11) from integral, we getThus, as , it follows that Further,

#### 4. Basic Reproduction Number

The equilibrium point of system (4) satisfiesMultiplying both sides of formula (13) by and summing of , we obtain the following self-consistent equation about :Obviously, equation (14) has a zero solution . System (4) has a disease-free equilibrium point . Next, we discuss the existence of a unique positive solution. The first-order derivative of isIt is obviously that , is monotonically increasing with the increase of . The second derivative of isBecause , is convex function. Note that and . Thus, the sufficient and necessary condition which equation (14) has is a unique positive solution; namely, system (4) has a unique endemic disease equilibrium point ; that is,Thus, we can get the basic reproduction number of system (4) from equation (17):where is the second moment of the degree distribution and is the third moment of degree distribution. In conclusion, we obtain the following theorem.

Theorem 2. *If the basic reproduction number , system (4) has a disease-free equilibrium point ; if , system (4) has a disease-free equilibrium point and a unique endemic equilibrium point .*

#### 5. Stability of Equilibrium Points

First, we analyse the global stability of the disease-free equilibrium point.

Theorem 3. *If , the disease-free equilibrium point of system (4) is globally asymptotically stable within .*

*Proof. * is an invariant region of system (4). The Lyapunov function can be constructed asTaking the derivative along system (4) of formula (19), we can getTherefore, for all , when , . Furthermore, if and only if . So, we can obtain the global stability of the disease-free equilibrium.

Next, the local stability of the endemic equilibrium is analyzed.

Theorem 4. *If , then the endemic equilibrium of system (4) is locally asymptotically stable.*

*Proof. *Let ; we can get the following equation from system (4):where

Let us consider the linear systemswhereNext, we perform a similar transformation on matrix ; that is, multiply the first row by and add it to the row, and then multiply the column by to the first column; then, matrix becomes :Since matrices and have the same characteristic roots, we only need to consider the eigenvalues of matrix . The characteristic equation of matrix isObviously, when , the real part of all the eigenvalues of matrix is negative. The eigenvalues of are also the eigenvalues of the Jacobian matrix of system (4) at , so the endemic equilibrium point of system (4) is locally asymptotically stable.

Lemma 5. *Suppose that the initial relative infected densities satisfy and that basic reproduction number ; then, the solution of system (4) satisfies ; for any .*

*Proof. *Similar to proving the global stability of the disease-free equilibrium, the following equation can be obtained:Thus,Note that systemis logistic equation. Due to , system (28) is consistent. By the comparison theorem, it is easy to see that . Let . By system (2), we have, for all ,By comparison theorem,Hence, for .

Theorem 6. *Suppose that the initial relative infected densities satisfy and that ; then any solution of from the invariant set must satisfy , where are the unique nonzero stationary points of system (4).*

*Proof. *In order to prove this theorem, we first prove that the limit exists. For this purpose, we have to prove thatLetting , define the sequenceAccording to Lemma 1, for , . Therefore, for , we have , for . From Lemma 1 and system (4), we have We integrate the above inequality from , gettingTaking the limit as , we obtainBy the arbitrariness of , letting , we haveConsider the convergence of (32) defined sequences. For all .Similarly, it can be obtained thatBy induction, we know that for each , the sequence is decreasing, so its limit exists and is denoted by . Letting on both sides of formulas (32) and (39), we deduce that satisfies the following stability equation:Then,On the other hand, we consider the functionBy simple calculations, we obtainBy the definition of derivatives, if is sufficiently small, then . According to Lemma 5 and formula (44), we can take such thatWe define the following sequence:Similar to , proved by induction,Now, consider the convergence of the sequence defined by formula (46). First, according to formulas (41), (45), and (46), we haveBy formulas (46) and (48), we obtain If for all , , it follows from formula (46) that Thus, by induction, we know that, for each , the sequence , is increasing, so its limit exists and is denoted by . Letting on both sides of formulas (46) and (47), we deduce that the limit satisfies the following relations:By formulas (41) and (52), both and are positive stationary points of system (4); thus, by the uniqueness of the positive stationary point of system (4), we have that andThat is, , and Theorem 6 is proved.

#### 6. Numerical Simulation and Conclusion

In this section, we present some numerical simulations of system (3) in a random network and a scale-free network to study the effect of clustering coefficients on disease transmission. We first consider the degree distribution of the network. In the random network, obeying Poisson distribution is expressed as , where indicates the average degree of nodes in the network. In the scale-free network, obeying a Power-law distribution is expressed as , where represents the number of edges generated for each new node introduced in the network.

In Figure 2, we take the total number of nodes in the network , , and . Figures 2(a) and 2(b) show that the infection fractions and the basic reproduction number will be increasing with the clustering coefficient in the ER random network and the BA scale-free network. This means that the increase in clustering coefficient can easily cause some nodes to connect with their neighbor’s neighbors. So some triangles are formed; the final epidemic size will be increasing. From Figure 2(c), we compare the infection fractions in the ER random network and the BA scale-free network where the average degree is fixed and the clustering coefficient is changed. It is found that the increase in clustering coefficient always promotes the disease spreading.

**(a) The infection fractions of ER network**

**(b) The infection fractions of BA network**

**(c) Comparison of infection fractions between ER network and BA network**

In conclusion, the network model we presented more accurately depicts the special local relationships between individuals in the contact network. We study the influence of clustering coefficients on the basic reproduction number and the infection fractions in the network. The basic reproduction number can change larger as the clustering coefficient increases. Thus, the disease is more easy to spread. Simulations indicate that the final infection fraction can increase when the clustering coefficient is larger. From the perspective of sociology and biology, the reduction of household or school clusters will effectively impede the disease spreading.

#### Data Availability

No data were used to support this study. The values of parameters that appeared in the simulations are assumed by us.

#### Conflicts of Interest

The authors declare that they have no conflicts of interest.

#### Acknowledgments

This work is supported by National Natural Science Foundation of China under Grant 11701528, 11571324 and Shanxi Province Youth Natural Science Foundation (201601D021015).

#### References

- S. N. Dorogovtsev, A. V. Goltsev, and J. F. F. Mendes, “Critical phenomena in complex networks,”
*Reviews of Modern Physics*, vol. 80, no. 4, pp. 1275–1335, 2008. View at: Publisher Site | Google Scholar - S. Bansal, B. T. Grenfell, and L. A. Meyers, “When individual behaviour matters: homogeneous and network models in epidemiology,”
*Journal of the Royal Society Interface*, vol. 4, no. 16, pp. 879–891, 2007. View at: Publisher Site | Google Scholar - S. N. Dorogovtsev and J. F. F. Mendes,
*Evolution of Networks: From Biological Nets to the Internet and WWW*, Oxford University Press, Oxford, UK, 2013. View at: MathSciNet - M. E. J. Newman, “The structure and function of complex networks,”
*SIAM Review*, vol. 45, no. 2, pp. 167–256, 2003. View at: Publisher Site | Google Scholar | MathSciNet - C. Bianca, F. Pappalardo, S. Motta, and M. A. Ragusa, “Persistence analysis in a Kolmogorov-type model for cancer-immune system competition,” in
*Proceedings of the AIP Conference*, vol. 1558, pp. 1797–1800, 2013. View at: Publisher Site | Google Scholar - C. Bianca, M. Pennisi, S. Motta, and M. A. Ragusa, “Immune system network and cancer vaccine,” in
*Proceedings of the AIP Conference*, vol. 1389, pp. 945–948, 2011. View at: Publisher Site | Google Scholar - B. Szendroi and G. Csányi, “Polynomial epidemics and clustering in contact networks,”
*Proceedings of the Royal Society B Biological Science*, vol. 271, no. 5, pp. S364–S366, 2004. View at: Publisher Site | Google Scholar - E. M. Volz, J. C. Miller, A. Galvani, and L. A. Meyers, “Effects of heterogeneous and clustered contact patterns on infectious disease dynamics,”
*PLoS Computational Biology*, vol. 7, no. 6, Article ID e1002042, p. 13, 2011. View at: Publisher Site | Google Scholar | MathSciNet - R. Pastor-Satorras and A. Vespignani, “Epidemic spreading in scale-free networks,”
*Physical Review Letters*, vol. 86, no. 14, pp. 3200–3203, 2001. View at: Publisher Site | Google Scholar - L. A. Meyers, “Contact network epidemiology: bond percolation applied to infectious disease prediction and control,”
*Bulletin (New Series) of the American Mathematical Society*, vol. 44, no. 1, pp. 63–86, 2007. View at: Publisher Site | Google Scholar - M. E. Newman, “Random graphs with clustering,”
*Physical Review Letters*, vol. 103, Article ID 058701, p. 5, 2009. View at: Publisher Site | Google Scholar - K. T. D. Eames, “Modelling disease spread through random and regular contacts in clustered populations,”
*Theoretical Population Biology*, vol. 73, no. 1, pp. 104–111, 2008. View at: Publisher Site | Google Scholar - J. C. Miller, “Spread of infectious disease through clustered populations,”
*Journal of the Royal Society Interface*, vol. 6, no. 41, pp. 1121–1134, 2009. View at: Publisher Site | Google Scholar - J. C. Miller, “Percolation and epidemics in random clustered networks,”
*Physical Review E: Statistical, Nonlinear, and Soft Matter Physics*, vol. 80, no. 2, Article ID 020901, p. 4, 2009. View at: Publisher Site | Google Scholar | MathSciNet - P. Trapman, “On analytical approaches to epidemics on networks,”
*Theoretical Population Biology*, vol. 71, no. 2, pp. 160–173, 2007. View at: Publisher Site | Google Scholar - S. Li and Z. Jin, “Impacts of cluster on network topology structure and epidemic spreading,”
*Discrete & Continuous Dynamical Systems - B*, vol. 22, no. 10, pp. 3749–3770, 2017. View at: Publisher Site | Google Scholar - S. N. Dorogovtsev, “Clustering of correlated networks,”
*Physical Review E: Statistical, Nonlinear, and Soft Matter Physics*, vol. 69, no. 2, Article ID 027104, p. 4, 2004. View at: Publisher Site | Google Scholar - D. J. Watts and S. H. Strogatz, “Collective dynamics of 'small-world' networks,”
*Nature*, vol. 393, no. 6684, pp. 440–442, 1998. View at: Publisher Site | Google Scholar | MathSciNet

#### Copyright

Copyright © 2019 Jingjing Tian and Shuping Li. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.