Research Article | Open Access

Lurong Jiang, Qiaoyu Xu, Bo Ouyang, Yicong Lang, Yanyun Dai, Jijun Tong, "Epidemic Spreading in Interdependent Networks", *Mathematical Problems in Engineering*, vol. 2018, Article ID 9374039, 10 pages, 2018. https://doi.org/10.1155/2018/9374039

# Epidemic Spreading in Interdependent Networks

**Academic Editor:**Qingling Zhang

#### Abstract

We introduce a dynamic process of epidemic spreading into interdependent networks because, in reality, interdependent networks are facing the threat of epidemic spreading, which still lacks research. With our model, we reveal that (i) interdependent networks are more fragile than an isolated single network when facing the threat of an epidemic; (ii) an epidemic is not massively blocked by cascading failure, even if cascading failure spreads much faster; (iii) interdependent networks are more fragile, with a larger value of average degree compared with epidemic spreading. Moreover, we propose an iterative method for estimating the fraction of removed or failed nodes in a system of interdependent networks using percolation theory. This research can improve the comprehension of interdependent networks from the point of view of epidemic spreading.

#### 1. Introduction

With deeper research in network science, people have begun to realize that many interdependent relations exist among networks [1–3]. One of the core features of interdependent networks is that the existence or functioning of nodes in one network highly interacts with and depends on the existence or functioning of nodes in another network and vice versa [4–6]. For example, in a typical system of interdependent networks formed by a communication network and power grid network, communication nodes depend on power stations for electricity supply, and power stations depend on communication nodes for control. Motivated by the exploration for the robustness of interdependent networks, current research on interdependent networks mainly focuses on the robustness of a system under the conditions of removing or deleting a fraction of nodes, which then leads to a chain reaction of node failure [7–11].

In reality, interdependent networks, especially those systems of interdependent networks formed by communication networks and other infrastructure networks, face many other threats, such as failure of overload [12–14] and epidemic spreading [15]. The interdependent relationship among networks is considered as a major issue in diffusion and spreading processes over a multilayer networks system [16, 17]. In recent years, some researchers have explored the mechanism of epidemic spreading in multilayer networks, especially in interdependent networks according to the features of virus spreading in real multilayer network system [18, 19]. Most of these researches focus on revealing the epidemic threshold in interconnected and interdependent networks [20, 21]. However, until now, there are still only very few studies on these threats of epidemic spreading in interdependent networks. The spreading of an epidemic is one of the threats in interdependent networks. Some reports have shown that systems of interdependent networks coupled with a communication network and power grid network becomes vulnerable to the threat of computer viruses, leaving the power grid networks vulnerable to fail [22, 23]. Interdependent networks can lead to cascading failure after only a few nodes in a communication network become infected and no longer work.

Therefore, it is necessary to explore the dynamic process of epidemic spreading in interdependent networks. Although interdependent networks are threatened by epidemics, to the best of our knowledge, this subject still has largely unexplored issues.

In this study, we introduce the dynamic process of epidemic spreading into interdependent networks and explore the complicated dynamical interplay between epidemic spreading and cascading failure in interdependent networks using percolation theory. The remainder of this article is organized as follows. In Section 2, we introduce the network model and epidemic spreading model. In Section 3.1, we qualitatively analyze the results of epidemic spreading in interdependent networks. In Section 3.2, we propose an iterative method for estimating the fraction of removed or failed nodes in a system of interdependent networks using percolation theory and validate it via simulations. Section 4 provides concluding remarks.

#### 2. Models

##### 2.1. Network Model

We first present an interdependent network model to describe the coupled patterns system structure. To simplify and clarify the results, we make reference to the model presented in [4] to construct interdependent networks. A system of interdependent networks consisting of two networks, and , is considered. Without loss of generality, networks and , with the same size and the same average degree , follow degree distributions of and , respectively. These two networks are coupled with random bidirectional interdependent links: (i) the functioning of an arbitrary node in network depends and only depends on a randomly picked node in network and vice versa; (ii) if stops functioning, also stops functioning and vice versa. Here, we say that node depends on node and vice versa.

##### 2.2. Dynamical Behavior Model

For example, in a system of interdependent networks , network is a communication network through which the epidemic spreads, while network is a power grid network. Combining the SIR epidemic spreading model and interdependent networks model, nodes statuses transition relations are revealed, as in Figure 1. In network , an arbitrary node is only in one of the four statuses: ** susceptible**,

**,**

*infected***, and**

*removed***. Susceptible nodes are those healthy and functioning nodes that can be infected. Infected nodes have the ability to infect their susceptible neighbors. Removed nodes are those nonfunctioning nodes from infected status, which cannot be infected again. A susceptible node becomes infected with a probability for each of its links, leading to an infected node, while an infected node becomes removed with probability for every time step. The epidemic effective spreading rate is . Without loss of generality, we let . A node in network fails due to three possible reasons: (i) an infected node loses its dependent node in network ; (ii) a susceptible node loses its dependent node in network ; (iii) a susceptible node is not in the mutually connected clusters (MCC). Both removed and failed nodes in network are nonfunctioning and cannot provide support for nodes in network . These failed nodes also no longer interact with other nodes in the consequent process either.**

*failed***(a) Network A**

**(b) Network B**

In network , each node is in only one of two statuses: ** susceptible** and

**. A susceptible node in network fails if (i) it loses its dependent node in network or (ii) it is not in the giant component formed by susceptible nodes. The dynamic process of epidemic spreading in interdependent networks is detailed in the following steps:(1)First, all nodes in the system of interdependent networks are susceptible. Randomly select a few nodes in network as the initial infected nodes.(2)**

*failed**Substep 2.1*. In network , for every link connecting an infected node to a susceptible node, the susceptible node becomes infected with probability , and, for every infected node, it becomes removed with probability 1.

*Substep 2.2*. The removal of nodes in network may cause chain reaction of nodes failure in both networks and . Repeat these cascades until all remaining nodes in network are in the MCC and supported by nodes in network and vice versa.(3)If there still exist infected nodes in network , go back to to start the next stage of epidemic spreading; otherwise, the process halts.

Note that we make an important assumption, i.e., that the time scale of the cascading failure is much smaller than that of epidemic propagation. This is because we consider the duration of cascading failures as much longer than that of epidemic spreading. For example, the cascading overload of the power grid network in the United States and Canada in 2003 only lasted for 8 minutes [24], while the spread of a computer virus can usually last for several months [25, 26]. Therefore, in our model, every single substep of epidemic spreading is executed until the chain reaction of node failure stops.

##### 2.3. An Example

To better understand the model, we give a simple example here, as shown in Figure 2. Networks and are coupled with each other to form a system of interdependent networks . Node in network A depends on node in network and vice versa. First, all nodes in networks and are susceptible and functioning. Then, node in network becomes infected as shown in Figure 2(a) and the system falls into an unstable dynamic process. In stage 1, node is infected by node with probably , and then is removed due to infection. Node fails because it does not connect to the MCC. In network , nodes and fail because they lose their dependent nodes and in network . Then, all survival nodes (including node ) in network connect to the MCC and are supported by nodes in network and vice versa. Therefore, stage 1 finishes as illustrated in Figure 2(b). However, there still exists an infected node in network ; thus, the dynamic process enters into stage 2. Node becomes infected with probably as it connects to node ; then, node is removed. Node fails because it loses its support node . Then, all survival nodes in network connect to MCC and are supported by nodes in network and vice versa. Therefore, stage 2 finishes, as shown in Figure 2(c). Because there still exists an infected node in network , the dynamic process enters the next stage. In stage 3, none of the neighbors of in network become infected, and node is removed after a time step. Node fails because it does not connect to the MCC in network . Nodes and fail because and either fail or are removed in this stage. Now, there is no infected node in network , and the dynamic process halts; thus stage 3 is the final status after epidemic spreading in interdependent networks.

**(a) Start**

**(b) Stage 1**

**(c) Stage 2**

**(d) Stage 3**

#### 3. Analysis

##### 3.1. Qualitative Analysis

In this section, we qualitatively analyze the epidemic spreading in interdependent networks using the simulation results. Figures 3 and 4 exhibit the fractions of removed nodes and failed nodes in network and the fraction of failed nodes in network with varied epidemic effective spreading rates , in coupled ER (Erdös Rényi) and BA (Barabási Albert) networks. Notice that the fraction of failed nodes in network equals the sum of the fractions of removed and failed nodes in network , which indicates that . All the results shown are averaged over 50 realizations. The performances of results are enumerated qualitatively as follows.

**(a)**

**(b)**

**(c) or**

**(a)**

**(b)**

**(c) or**

##### 3.2. Quantitative Analysis

In this section, we quantitatively analyze the proportion of removed nodes and failed nodes in network and the proportion of failed nodes in network .

###### 3.2.1. Two Types of Percolation Processes

The spreading of an epidemic is a* bond percolation* process [27, 28]. The process of epidemic spreading is equivalent to selecting a link from a network with probability , and the outbreak of an epidemic indicates that the set of chosen links forms a connectivity cluster. Cascading failure is equivalent to a* site percolation* [29, 30]. In our model, when an epidemic spreads out, there exist several nodes in network participating in both bond percolation and site percolation. We assume that these nodes in network belong to the bond percolation process rather than to the site percolation process, because, in each time step, the spreading of the epidemic causes a further dynamic process of cascading failure and cascading failure is not strong enough to block an epidemic as mentioned in the** Qualitative Analysis**.

We denote and as the probability that a node of degree in network participates in site percolation and bond percolation, respectively. We denote and as the probability that a node of degree in network fails or is removed, respectively, after the dynamic process terminates in steady state. We denote and as the probability that a node of degree in network participates in site percolation or fails in steady state, respectively. According to our assumption regarding those nodes for both participating bond percolation and site percolation, we have

In a coupled degree-degree uncorrelated interdependent system of networks, the neighbor of an arbitrary node in network becomes a failed node or removed node with probability or , respectively, and the neighbor of an arbitrary node in network becomes a failed node with probability , which are calculated as follows:

###### 3.2.2. The Proportion of Removed Nodes in Network

In network , a susceptible node will be infected with probability for each link connecting to an infected node. Therefore, considering the locally tree-like approximation in percolation, the probability that nodes of degree in network participate in bond percolation isSubstituting (7) into (2), we get the probability that nodes of degree in network will become removed nodes is

###### 3.2.3. The Proportion of Failed Nodes in Network

From a microscopic view, the failure of a coupled pair of nodes and starts from one side to the other side. Thus, we define two parameters describing the direction of reaction between this coupled pair of nodes:(i): the probability that the failure of node in network is caused by losing the dependent node in network directly.(ii): the probability that the failure of node in network is caused by losing the dependent node in network directly.

Then, an arbitrary node of degree in network who participates in site percolation can be divided into two situations:(i)The probability that the failure of is caused by losing the dependent node directly is defined as(ii)The probability that node fails and the failure is NOT caused by losing the dependent node directly is defined as

Substituting (8), (9), and (10) into (1), we can get the probability that nodes with degree in network fail

###### 3.2.4. The Proportion of Failed Nodes in Network

Similarly, an arbitrary node of degree in network that participates in site percolation can be divided into two situations:(i)The probability that the failure of is caused by losing the dependent node directly is defined as(ii)The probability that node fails and the failure is NOT caused by losing the dependent node directly is defined as

Substituting (12) and (13) into (3), we can get the probability that nodes with degree in network fail:

###### 3.2.5. The Relationship between Parameters and

According to the definition of , it is equivalent to the probability that a node of network fails first and then leads to the failure of a random node in network as shown in the following equation:

is equivalent to the probability that a node of network is removed or fails first and then leads to the failure of a random node in network as follows:

###### 3.2.6. The Proportion of All Nodes

Now we achieve the derivation by using (4), (5), (6), (8), (11), and (14). For clarity, we relist them as follows:

Obviously, these six equations depend on each other. Thus we can get the fraction of removed nodes and the fraction of failed nodes of network and the fraction of failed nodes of network in a steady state from these six equations via the following iteration process:(1)Assign a very small initial value to , where represents the minimum degree of nodes in network . Let , , and . Substitute , , and into (17), (18), and (19) and get the initial values of , , , , and .(2)Substitute , , , , and into (20), (21), and (22) to get the values of , , and . Next, substitute the new values of , , and into (17), (18), and (19) and then update , , , , and . Repeat this step until convergence.(3)Get the fraction of removed and failed nodes in network by using and and the fraction of failed nodes in network by using .

#### 4. Simulations and Discussion

We test the validity of the analytical predictions/results in coupled ER random networks and coupled BA scale-free networks with varied average degree . The simulation results are illustrated in Figures 6–11. Each data point is the average of 50 dependent realizations.

**(a)**

**(b)**

**(c) or**

**(a)**

**(b)**

**(c) or**

**(a)**

**(b)**

**(c) or**

**(a)**

**(b)**

**(c) or**

**(a)**

**(b)**

**(c) or**

**(a)**

**(b)**

**(c) or**

It can be seen from Figures 6–11 that, on the whole, our theoretical values are in good, though not perfect, agreement with the simulation results. In Figures 6–11 , the epidemic breaks out if is larger than a critical value. When is large enough for the epidemic to break out, the theoretical value of is a little smaller than the simulation result of . As increases, the deviation of between the theoretical value and simulation result becomes smaller. In contrast, the theoretical value of becomes larger than the simulation result of , which is larger than the simulation results of when the epidemic breaks out, and the deviation of decreases as increases, as shown in Figures 6–11 . The reason for these deviations is that nodes that participate both in the bond percolation (epidemic spreading) and in site percolation (cascading failure) processes are supposed to belong to the former one in the theoretical prediction. Therefore, in network , the fraction of removed nodes is overvalued, while the fraction of failed nodes is undervalued. However, the theoretical values of and can describe the trend of simulation values of and with increasing , as shown in Figures 6–11,(b). In Figures 6–11 , the fraction of nonfunctioning nodes in networks and is well estimated.

In order to understand the dynamic behaviors closer to the real network topology structure, we further constructed an scene that a wireless network coupled with a scale-free network. Assume that epidemic spreads in the wireless network, which causes the entire coupled networks into cascading failure. We select DNG (Delaunay triangulation graph), KNN (k-nearest neighbor), and LAEE (local-area and energy-efficient) topologies for wireless networks [31]. In the experiment, the number of nodes in each network is 4000, and the transmission range is 100 meters. Each value is the average of 50 dependent realizations. As Figure 12(a) shows, with the epidemic effective spreading rate increases, only some nodes in the wireless network eventually become removed. This shows that the spread of epidemic has been significantly hampered in these coupled structure. The reason for this phenomenon is that when is very large, a large number of nodes in the network are removed and failed, and then some of the epidemic transmission paths are cut off, as shown in Figure 12(b). Compared with separate wireless networks, coupled networks of wireless networks and other networks are more vulnerable to epidemic spreading. This is because there are both epidemic transmission and cascade failure in these coupled networks, as shown in Figure 12(c).

**(a)**

**(b)**

**(c) or**

#### 5. Conclusion

Researching interdependent networks has been one of the hotspots of complex network science in recent years. Current studies on interdependent networks mainly focus on the robustness of a system with the condition of deleting a fraction of nodes. In reality, interdependent networks face other threats, such as the spread of epidemics, which still lacks research. Therefore, we propose a model that introduces the dynamic process of epidemic spreading into interdependent networks. With our model, we reveal that (i) interdependent networks are more fragile than an isolated single network when facing the threat of an epidemic, (ii) an epidemic is not massively blocked by cascading failure, even if cascading failure spreads much faster, and (iii) interdependent networks are more fragile, with a larger value of compared with epidemic spreading. Moreover, we propose an iterative method for estimating the fraction of removed or failed nodes in a system of interdependent networks using percolation theory and validate it via simulations. We believe this research can improve the comprehension of interdependent networks from the point of view of epidemic spreading.

#### Data Availability

The data used to support the findings of this study are available from the corresponding author upon request.

#### Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.

#### Acknowledgments

This work is supported by the National Natural Science Foundation of China (61602417), Zhejiang provincial key research and development plan (2015C03023), Public Welfare Project of Zhejiang Province under Grant No. 2014C33102, and “521” Talent Project of ZSTU.

#### References

- V. Rosato, L. Issacharoff, F. Tiriticco, S. Meloni, S. De Porcellinis, and R. Setola, “Modelling interdependent infrastructures using interacting dynamical models,”
*International Journal of Critical Infrastructures*, vol. 4, no. 1-2, pp. 63–79, 2008. View at: Publisher Site | Google Scholar - R. Parshani, C. Rozenblat, D. Ietri, C. Ducruet, and S. Havlin, “Inter-similarity between coupled networks,”
*EPL (Europhysics Letters)*, vol. 92, no. 6, 2010. View at: Google Scholar - R. Parshani, S. V. Buldyrev, and S. Havlin, “Interdependent networks: reducing the coupling strength leads to a change from a first to second order percolation transition,”
*Physical Review Letters*, vol. 105, Article ID 048701, 4 pages, 2010. View at: Publisher Site | Google Scholar - S. V. Buldyrev, R. Parshani, G. Paul, H. E. Stanley, and S. Havlin, “Catastrophic cascade of failures in interdependent networks,”
*Nature*, vol. 464, no. 7291, pp. 1025–1028, 2010. View at: Publisher Site | Google Scholar - S. Havlin, H. E. Stanley, A. Bashan, J. Gao, and D. Y. Kenett, “Percolation of interdependent network of networks,”
*Chaos, Solitons & Fractals*, vol. 72, pp. 4–19, 2015. View at: Publisher Site | Google Scholar - G. Dong, R. Du, L. Tian, and R. Liu, “Robustness of network of networks with interdependent and interconnected links,”
*Physica A: Statistical Mechanics and its Applications*, vol. 424, pp. 11–18, 2015. View at: Publisher Site | Google Scholar - S. Watanabe and Y. Kabashima, “Cavity-based robustness analysis of interdependent networks: Influences of intranetwork and internetwork degree-degree correlations,”
*Physical Review E*, vol. 89, no. 1, Article ID 012808, 2014. View at: Google Scholar - X. Yuan, S. Shao, H. E. Stanley, and S. Havlin, “How breadth of degree distribution influences network robustness: Comparing localized and random attacks,”
*Physical Review E*, vol. 92, Article ID 032122, 2015. View at: Google Scholar - D. Hao, Z. Rong, and T. Zhou, “Extortion under uncertainty: zero-determinant strategies in noisy games,”
*Physical Review*, vol. 91, no. 5, Article ID 052803, 2015. View at: Google Scholar - A. Ranjkesh, M. Ambrožič, S. Kralj, and T. J. Sluckin, “Computational studies of history dependence in nematic liquid crystals in random environments,”
*Physical Review E: Statistical, Nonlinear, and Soft Matter Physics*, vol. 89, no. 2, Article ID 022504, 2014. View at: Publisher Site | Google Scholar - X. Huang, S. Shao, H. Wang, S. V. Buldyrev, H. Eugene Stanley, and S. Havlin, “The robustness of interdependent clustered networks,”
*EPL (Europhysics Letters)*, vol. 101, no. 1, p. 18002, 2013. View at: Publisher Site | Google Scholar - Z. Chen, W.-B. Du, X.-B. Cao, and X.-L. Zhou, “Cascading failure of interdependent networks with different coupling preference under targeted attack,”
*Chaos, Solitons & Fractals*, vol. 80, pp. 7–12, 2015. View at: Google Scholar - T. I. Tylec and M. Kuś, “Non-signaling boxes and quantum logics,”
*Journal of Physics A: Mathematical and Theoretical*, vol. 48, no. 50, Article ID 505303, 17 pages, 2015. View at: Publisher Site | Google Scholar | MathSciNet - L. Tang, K. Jing, J. He, and H. E. Stanley, “Complex interdependent supply chain networks: cascading failure and robustness,”
*Physica A: Statistical Mechanics and its Applications*, vol. 443, pp. 58–69, 2016. View at: Publisher Site | Google Scholar | MathSciNet - M. Salehi, P. Siyari, M. Magnani, and D. Montesi, “Multidimensional epidemic thresholds in diffusion processes over interdependent networks,”
*Chaos, Solitons & Fractals*, vol. 72, pp. 59–67, 2015. View at: Publisher Site | Google Scholar - R. Pastor-Satorras, C. Castellano, P. Van Mieghem, and A. Vespignani, “Epidemic processes in complex networks,”
*Reviews of Modern Physics*, vol. 87, no. 3, pp. 925–979, 2015. View at: Publisher Site | Google Scholar | MathSciNet - M. Salehi, R. Sharma, M. Marzolla, M. Magnani, P. Siyari, and D. Montesi, “Spreading Processes in Multilayer Networks,”
*IEEE Transactions on Network Science and Engineering*, vol. 2, no. 2, pp. 65–83, 2015. View at: Publisher Site | Google Scholar - L.-X. Yang, X. Yang, and Y. Y. Tang, “A bi-virus competing spreading model with generic infection rates,”
*IEEE Transactions on Network Science and Engineering*, vol. 5, pp. 2–13, 2018. View at: Google Scholar - L.-X. Yang, X. Yang, and Y. Wu, “The impact of patch forwarding on the prevalence of computer virus: A theoretical assessment approach,”
*Applied Mathematical Modelling*, vol. 43, pp. 110–125, 2017. View at: Publisher Site | Google Scholar - A. Saumell-Mendiola, M. A. Serrano, and M. Boguñá, “Epidemic spreading on interconnected networks,”
*Physical Review E: Statistical, Nonlinear, and Soft Matter Physics*, vol. 86, no. 2, 2012. View at: Google Scholar - H. Wang, Q. Li, G. D’Agostino, S. Havlin, H. E. Stanley, and P. Van Mieghem, “Effect of the interconnected network structure on the epidemic threshold,”
*Physical Review E: Statistical, Nonlinear, and Soft Matter Physics*, vol. 88, no. 2, 2013. View at: Publisher Site | Google Scholar - A. R. Metke and R. L. Ekl, “Security technology for smart grid networks,”
*IEEE Transactions on Smart Grid*, vol. 1, no. 1, pp. 99–107, 2010. View at: Publisher Site | Google Scholar - R. Tan, V. B. Krishna, D. K. Y. Yau, and Z. Kalbarczyk, “Integrity attacks on real-time pricing in electric power grids,”
*ACM Transactions on Information and System Security*, vol. 18, no. 2, 2015. View at: Google Scholar - B. Liscouski and W. Elliot, “Final report on the august 14, 2003 blackout in the united states and canada,”
*Causes and Recommendations. A Report to US Department of Energy 40*, 2004. View at: Google Scholar - X. Han and Q. Tan, “Dynamical behavior of computer virus on Internet,”
*Applied Mathematics and Computation*, vol. 217, no. 6, pp. 2520–2526, 2010. View at: Publisher Site | Google Scholar | MathSciNet - C. C. Zou, D. Towsley, and W. Gong, “Email virus propagation modeling and analysis,” Tech. Rep. TR-CSE-03-04, Department of Electrical and Computer Engineering, Massachusetts University, Amherst, Mass, USA, 2003. View at: Google Scholar
- M. E. Newman, “Spread of epidemic disease on networks,”
*Physical Review E: Statistical, Nonlinear, and Soft Matter Physics*, vol. 66, no. 1, 016128, 11 pages, 2002. View at: Publisher Site | Google Scholar | MathSciNet - B. Karrer and M. Newman, “Message passing approach for general epidemic models,”
*Physical Review E*, vol. 82, Article ID 016101, 2010. View at: Google Scholar - J. P. Gleeson, “Cascades on correlated and modular random networks,”
*Physical Review E: Statistical, Nonlinear, and Soft Matter Physics*, vol. 77, no. 4, Article ID 046117, 2008. View at: Publisher Site | Google Scholar - A. Hackett, S. Melnik, and J. P. Gleeson, “Cascades on a class of clustered random networks,”
*Physical Review E*, vol. 83, Article ID 056107, 2011. View at: Google Scholar - L. Jiang, X. Jin, Y. Xia, B. Ouyang, D. Wu, and X. Chen, “A scale-free topology construction model for wireless sensor networks,”
*International Journal of Distributed Sensor Networks*, vol. 10, no. 8, Article ID 764698, 2014. View at: Publisher Site | Google Scholar

#### Copyright

Copyright © 2018 Lurong Jiang et al. 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.