- About this Journal ·
- Abstracting and Indexing ·
- Advance Access ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents
Mathematical Problems in Engineering
Volume 2013 (2013), Article ID 204093, 10 pages
Optimal Control Strategy for Traffic Driven Epidemic Spreading Based on Community Structure
1Jiangsu Information Analysis Engineering Laboratory, Jinling Institute of Technology, Nanjing, Jiangsu 211169, China
2Center for Control and Intelligence Technology, Nanjing University of Posts & Telecommunications, Nanjing, Jiangsu 211169, China
3Department of Information Technology, Jinling Institute of Technology, Nanjing, Jiangsu 211169, China
Received 18 May 2013; Accepted 13 August 2013
Academic Editor: Zhengguang Wu
Copyright © 2013 Fei Shao and Guo-Ping Jiang. 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.
It is shown that community structure has a great impact on traffic transportation and epidemic spreading. The density of infected nodes and the epidemic threshold have been proven to have significant relationship with the node betweenness in traffic driven epidemic spreading method. In this paper, considering the impact of community structure on traffic driven epidemic spreading, an effective and novel strategy to control epidemic spreading in scale-free networks is proposed. Theoretical analysis shows that the new control strategy will obviously increase the ratio between the first and the second moments of the node betweenness distribution in scale-free networks. It is also found that the more accurate the community is identified, the stronger community structure the network has and the more efficient the control strategy is. Simulations on both computer-generated and real-world networks have confirmed the theoretical results.
In the past few years, lots of epidemics among humans, animals, and plants caused an enormous amount of damage and loss. Since lots of real-world networks can be properly described as complex networks with nodes representing individuals and edges denoting the interactions among them, the disease outbreaks in biological systems can be viewed as the epidemic spreading on complex networks. With the booming development of complex networks theory, a number of models have been proposed to characterize the epidemic spreading [1–11]. In those most extensively studied models, they assume that the spreading is driven by reaction processes, which occurs from every infected node through all its neighbours at each time step. Some disease contagions, however, are found to interact only with a small subset of their neighbours: hubs do not always interact with all their neighbours at the same time , and individuals in a social network do not interact simultaneously with all of their acquaintances . A novel approach called traffic driven epidemic spreading is introduced to investigate the outcome of epidemic spreading process driven by traffic flows [7, 14–16]. Through theoretical predictions and extensive numerical simulations, it is shown that the traffic driven epidemic spreading depends directly on flow conditions, in particular on the node betweenness distribution. (Betweenness is a measure of the extent to which a node lies on the paths between others).
Accompanied with the continuing study of complex networks, community structure, a common feature of many networks [17–23] (which is the tendency for nodes to divide into subsets within which node-node connections are dense but between which connections are sparser) is proven to have the impact on information transfer capacity and epidemic spreading [24–28]. We have also proposed a novel routing strategy based on community structure which can reduce the betweenness of the nodes at the edge of the communities by minimizing the number of the communities with the shortest path passing through to enhance the packet delivery capability.
Aiming at controlling the epidemic spreading, we propose a control strategy to reshape the distribution of node betweenness based on community structure. And we disclose that the strategy increases the average routing length and the average node betweenness so that it has no effect on homogeneous networks. However, it has obvious effects on controlling the epidemic spreading in scale-free networks because it can enrich the ratio between the first and the second moments of the node betweenness distribution.
The routing dynamics model can be described as follows: all the nodes can create packets with addresses of destination, receive packets from other nodes, and route packets to their destinations; at each time step, a packet is generated with probability with randomly chosen origins and destinations, and all the packets are forwarded one step toward their destinations according to the routing strategy; a packet, upon reaching its destination, is removed from the system. And in this paper, two distinct widely used routing strategies are presented: shortest path routing strategy , SHT, which has the minimum number of nodes in the path; efficient path routing strategy , EFF, which has the minimum number of the sum of node degrees in the path.
Our control strategy based on community structure is simply stated as follows:(1)divide network into communities, and let be the community node that belongs to, the set of all nodes in community , and the subgraph of original network with nodes in set . If there is any edge between and , ; otherwise, ;(2)if , ;(3)if and , ;(4)if and , , is the communities sequence which connects with and passes through the minimum number of communities;(5)use a certain algorithm in the subgraph subnet to get the path between nodes and : if the shortest path routing strategy is used, we name the control strategy as CSHT, CEFF for efficient path routing strategy. And in both strategies, a parameter, mods, is used to describe the number of the divided communities.
How to divide network into communities is of the first importance. We use the extremal optimization-based algorithm presented by Duch and Arenas  to divide the network into communities, while the GN algorithm  to divide network into a given single digit of communities. And to investigate the influence of the accuracy of community structure identification on the validity of the control strategy, we employ the modularity measure which is proposed in [17, 18]. Consider a particular division of a network into communities, and let us define an symmetric matrix whose element is the fraction of all edges in the network that link nodes in community to nodes in community . The modularity measure, , is defined as follows: where is the sum of for a certain , that is, . Different divisions lead to different where the maximum of them is named as . The higher the modularity , the stronger the community structure the network has. In our strategy, we use DA algorithm  to divide network into communities to get the highest modularity .
In those widely used spreading models, an individual is represented by a node which can be classified in two or three possible states: susceptible (which will not infect others but may be infected), infected (which is infective), and recovered (which is recovered and has acquired immunization). We use SI model to discuss the density of infected nodes and SIR model to investigate the epidemic threshold in both homogeneous networks and heterogeneous networks such as scale-free networks.
3.1. Traffic Driven Epidemic Spreading in Homogeneous Networks
SI model is used in the scenario that infected nodes remain always infective with only one step: susceptible → infected. Starting from an initial fraction of infected individuals, , the infection spreads in the network through packet exchanges. A susceptible node has a probability of becoming infected every time it receives a packet from an infected neighbour. After a transient time, we compute the average density of infected nodes, , which is the prevalence of epidemic in the network. The approximate results of the density of infected nodes in homogeneous networks can be obtained using mean-field theory as follows:
Equation (2) means that the average density of newly infected nodes is proportional to the effective spreading rate , the density of susceptible nodes that may become infected, , the probability of a packet passing through a link pointing to an infected node, , the total number of packets, , and the fraction of packet passing through node which is equal to the average betweenness, . Equation (2) can be solved with the initial condition ,
When the epidemic begins spreading, the density of infected nodes is very small, and we can get that where the epidemic outbreak time scale of homogeneous networks is
SIR model is often used while nodes run stochastically through the cycle susceptible → infected → recovered. At each time step, a susceptible node has a probability of becoming infected every time it receives a packet from an infected one. At the same time, the infected nodes will be cured and will return to the recovered state with probability . An effective spreading rate is defined as the effective infected probability. Without lack of generality, we can set , since it only affects the definition of the time scale of the disease propagation. Thus in homogeneous networks, we add the decaying item, which is proportional to the product of the curing rate (here ) and the average density of infected nodes , to the right side of (2):
After imposing the stationary condition of (6), , we obtain the epidemic threshold of traffic driven SIR epidemic model in homogeneous networks:
3.2. Traffic Driven Epidemic Spreading in Scale-Free Networks
And in scale-free networks, the equation is
The right-hand side takes into account the probability that a node with links belongs to the susceptible class represented by and gets the infection via packets travelling from infected nodes. The latter process is determined by the spreading probability , the number of packets that a node of degree receives at each time step , and the probability that a packet travels through a link pointing to an infected node.
Assume that the network is uncorrelated, takes the form
When the epidemic begins spreading, the density of infected nodes is very small, and (8) yields
With the initial condition and we obtain
And the epidemic outbreaks time scale of scale-free networks is
We can also get the epidemic threshold of traffic driven SIR epidemic model in scale-free networks:
4. Simulation Results and Discussions
At first, we employ a family of pseudorandom networks , since all other properties will be equivalent to fully random networks except the controllable varying strength of community structure. These networks are comprised of 128 nodes which are split into 4 communities of 32 nodes each. Each node has on average edges connecting it to nodes of the same community and edges to nodes of other communities. While is varied, the value of is chosen to keep the average degree constant, and set to 16 in our paper. As is increased, the communities become better defined and easier to identify. Here, we use networks with (which is the same as a real random network with ), 12 (), and 15 (). Then, we divide these networks into mods = 1 (no division of network, the traditional SHT or EFF strategy), 2, 4(actually, in these networks), and 8 communities to test the validity of our control strategies by checking the average density of infected nodes. In all simulations, we generate 100 instances, and the result is the average of the 100 instances. What is more, the propagation is computed averaging over 100 different starting configurations in a certain instance.
As shown in Figure 1, there is only minor difference between CSHT and CEFF in the homogeneous networks. And in every situation, when we use our control strategy with , and 8, the average routing length is increasing, which means that the traffic will pass through more nodes. Consequently, the average node betweenness is increasing which results in the decline of epidemic outbreak time scale. And in simulations, there will be more infected nodes in the networks using our control strategy with than mods = 1 (the traditional strategy) which means that our control strategy does not work in the homogeneous networks.
As (4) shows, epidemic spreading in homogeneous networks is proportional to the average betweenness . In our strategy, the packet will pass through more nodes which will result in the increase of average betweenness. That is why our controlling strategy does not work in homogeneous networks.
From Figure 2(a) we can observe that when the spreading rate is lower than 0.49, the infected nodes disappear; while it is up to 0.50, the infections can proliferate on the networks. It means that the critical epidemic threshold is between 0.49 and 0.50 which is in good agreement with the result of (7) in Table 1, so are the others. And the comparison between mods = 1 and mods = 4() also certifies that our control strategy does not work in the homogeneous networks.
Then, we survey the effectiveness of our strategy in scale-free networks. We generate scale-free network  with 100 nodes and BA parameter and ER network  with 100 nodes and ER parameter . The two networks have the same node number and the same average degree .
As Figure 3 shows, epidemic spreads more quickly on the scale-free networks because of their heterogeneous structure. And CSHT can significantly reduce the average density of infected nodes in scale-free networks, when we divided the network into communities, while CSHT does not work in homogeneous networks. And CEFF is also ineffective in both situations. Then, we focus on the node betweenness of scale-free networks to check the effect of different control strategies.
Figure 4 provides insight into how the control strategy works by comparing the betweenness distributions with different parameter mods in the case of a BA network with 100 nodes and BA parameter . Figure 4(a) shows the betweenness plotted against the node index with mods = 1, for CSHT, while Figure 4(c) shows histograms of the betweenness distribution. When mods = 1, which means that the packet will travel via the traditional shortest path or efficient path, the majority of the nodes have very low betweenness, but a small number of them are spread over a very wide range. When the network is divided into communities, node betweenness is confined to a narrow band, most of its upper edges are higher than previously shown in Figures 4(a) and 4(c). It means that there is a sharp increase in the average betweenness of the whole network, while the variance of the whole betweenness declines obviously more than the increase of the square of the average betweenness , which results in the decrease of the mean square of the betweenness . As shown in Figures 4(b) and 4(d), when we divide the network into a different number of communities, the betweenness of every node shows a little change. That is why CEFF also does not work.
Then, we check the impact of node number , BA parameter , and the accuracy of identified communities on our CSHT strategy. We generate a series of networks with different node numbers but with the same BA parameter and divide each of them into mods = 2 communities using GN algorithm and communities using DA algorithm. As shown in Figure 5, when we divided the network into communities, the highest modularity measure is obtained, which means better community structure identification.
The relation between critical epidemic threshold and node number is shown in Figure 6(a). Then, a series of networks with the same node number but different BA parameter are generated to get the relation between critical epidemic threshold and BA parameter in Figure 6(b).
As Figure 6(a) shows, when we use CSHT strategy with , we can obtain a higher critical epidemic threshold than with mods = 2 which means that the better the community structure identification is, the more effective our CSHT strategy works. As we presented in Figure 5, when the node number is increasing with BA parameter fixed to 2, the community structure the network has is becoming stronger. Combining the pheromone that the greater the node number is, the more the epidemic threshold is increased in Figure 6(a), we believe that the stronger community structure the network has, the more effective our CSHT strategy is. The conclusion is also proven by Figure 6(b) because when BA parameter increases, the BA network has fuzzy community structure, which results in the increasing rate of epidemic threshold being reduced.
Finally, we test our CSHT control strategy on a real-world network. We choose the E-mail network with 1133 nodes  and use split it into mods = 2, 15 communities with GN, DA algorithm, respectively. The critical epidemic threshold of the E-mail network is enhanced from 0.0406 (the traditional SHT strategy) to 0.0411 and 0.0451. It means that our strategy also makes the effect in the real-world network.
Considering the impact of community structure, this paper has proposed a new control strategy to restrain the traffic driven epidemic spreading in scale-free networks. The characteristic of our CSHT strategy is to increase the ratio between the first and the second moments of the node betweenness distribution in scale-free networks by minimizing the number of the communities the routing path passes through. Firstly, it has been found that our CSHT strategy works well in the scale-free networks. Secondly, we have also found that if a network is divided into more reasonable and more accurate communities or the network has stronger community structure, the increase of epidemic threshold is more pronounced. At last, we apply our CSHT strategy on the E-mail network to show the validity of the strategy on real-world networks.
This work was partially supported by the National Natural Science Foundation of China (Grant no. 60874091), the Six Projects Sponsoring Talent Summits of Jiangsu Province, China (Grant no. SJ209006), the Natural Science Foundation of Jiangsu Province, China (Grants nos. BK2010526, BK2012082), and the Scientific Innovation Program for University Research Students in Jiangsu Province, China (Grant no. CXZZ11_0403) and sponsored by Qing Lan Project.
- N. T. J. Bailey, The Mathematical Theory of Infectious Diseases and Its Applications, Hafner Press, New York, NY, USA, 1975.
- R. M. Anderson, R. M. May, and B. Anderson, Infectious Diseases of Humans: Dynamics and Control, Oxford University Press, Oxford, UK, 1992.
- R. Pastor-Satorras and A. Vespignani, “Epidemic dynamics and endemic states in complex networks,” Physical Review E, vol. 63, no. 6, Article ID 066117, 8 pages, 2001.
- R. M. May and A. L. Lloyd, “Infection dynamics on scale-free networks,” Physical Review E, vol. 64, no. 6, Article ID 066112, 4 pages, 2001.
- R. Pastor-Satorras and A. Vespignani, “Epidemic spreading in scale-free networks,” Physical Review Letters, vol. 86, no. 14, pp. 3200–3203, 2001.
- M. Barthélemy, A. Barrat, R. Pastor-Satorras, and A. Vespignani, “Velocity and hierarchical spread of epidemic outbreaks in scale-free networks,” Physical Review Letters, vol. 92, no. 17, Article ID 178701, 4 pages, 2004.
- H. X. Yang, W. X. Wang, Y. C. Lai, and B. H. Wang, “Traffic-driven epidemic spreading on networks of mobile agents,” Europhysics Letters, vol. 98, no. 6, article 68003, 2012.
- S. C. Ferreira, C. Castellano, and R. Pastor-Satorras, “Epidemic thresholds of the Susceptible-Infected-Susceptible model on networks: a comparison of numerical and theoretical results,” Physical Review E, vol. 86, no. 4, Article ID 041125, 8 pages, 2012.
- S. Aral and D. Walker, “Identifying influential and susceptible members of social networks,” Science, vol. 337, no. 6092, pp. 337–341, 2012.
- H. X. Yang, W. X. Wang, Y. C. Lai, Y. B. Xie, and B. H. Wang, “Control of epidemic spreading on complex networks by local traffic dynamics,” Physical Review E, vol. 84, no. 4, Article ID 045101, 2011.
- B. Karrer and M. E. J. Newman, “Competing epidemics on complex networks,” Physical Review E, vol. 84, no. 3, Article ID 036106, 2011.
- B. J. Kim, T. Jun, J. Y. Kim, and M. Y. Choi, “Network marketing on a small-world network,” Physica A, vol. 360, no. 2, pp. 493–504, 2006.
- F. Liljeros, C. R. Edling, L. A. Nunes Amaral, H. E. Stanley, and Y. Åberg, “Social networks: The web of human sexual contacts,” Nature, vol. 411, no. 6840, pp. 907–908, 2001.
- S. Meloni, A. Arenas, and Y. Moreno, “Traffic-driven epidemic spreading in finite-size scale-free networks,” Proceedings of the National Academy of Sciences of the United States of America, vol. 106, no. 40, pp. 16897–16902, 2009.
- F. Shao and G. P. Jiang, “Traffic driven epidemic spreading in homogeneous networks with community structure,” Journal of Networks, vol. 7, no. 5, pp. 850–855, 2012.
- H. X. Yang, W. X. Wang, and Y. C. Lai, “Traffic-driven epidemic outbreak on complex networks: How long does it take?” Chaos, vol. 22, no. 4, Article ID 043146, 2012.
- M. Girvan and M. E. J. Newman, “Community structure in social and biological networks,” Proceedings of the National Academy of Sciences of the United States of America, vol. 99, no. 12, pp. 7821–7826, 2002.
- M. E. J. Newman and M. Girvan, “Finding and evaluating community structure in networks,” Physical Review E, vol. 69, no. 2, Article ID 026113, 15 pages, 2004.
- J. Duch and A. Arenas, “Community detection in complex networks using extremal optimization,” Physical Review E, vol. 72, no. 2, Article ID 027104, 2005.
- M. E. J. Newman, “Communities, modules and large-scale structure in networks,” Nature Physics, vol. 8, no. 1, pp. 25–31, 2012.
- S. Fortunato, “Community detection in graphs,” Physics Reports, vol. 486, no. 3–5, pp. 75–174, 2010.
- R. Aldecoa and I. Marín, “Deciphering network community structure by surprise,” PLoS ONE, vol. 6, no. 9, Article ID e24195, 2011.
- M. E. J. Newman, “Modularity and community structure in networks,” Proceedings of the National Academy of Sciences of the United States of America, vol. 103, no. 23, pp. 8577–8582, 2006.
- L. Danon, A. Arenas, and A. Díaz-Guilera, “Impact of community structure on information transfer,” Physical Review E, vol. 77, no. 3, Article ID 036103, 2008.
- Z. Liu and H. U. Bambi, “Epidemic spreading in community networks,” Europhysics Letters, vol. 72, no. 2, pp. 315–321, 2005.
- X. Wu and Z. Liu, “How community structure influences epidemic spread in social networks,” Physica A, vol. 387, no. 2-3, pp. 623–630, 2008.
- W. Huang and C. Li, “Epidemic spreading in scale-free networks with community structure,” Journal of Statistical Mechanics: Theory and Experiment, no. 1, Article ID P01014, 2007.
- G. Yan, Z. Q. Fu, J. Ren, and W. X. Wang, “Collective synchronization induced by epidemic dynamics on complex networks with communities,” Physical Review E, vol. 75, no. 1, Article ID 016108, 2007.
- T. Zhou, “Mixing navigation on networks,” Physica A, vol. 387, no. 12, pp. 3025–3032, 2008.
- G. Yan, T. Zhou, B. Hu, Z. Q. Fu, and B. H. Wang, “Efficient routing on complex networks,” Physical Review E, vol. 73, no. 4, Article ID 046108, 5 pages, 2006.
- A. L. Barabási and R. Albert, “Emergence of scaling in random networks,” Science, vol. 286, no. 5439, pp. 509–512, 1999.
- P. Erdős and A. Rényi, “On the evolution of random graphs,” vol. 5, pp. 17–61, 1960.
- R. Guimerà, L. Danon, A. Díaz-Guilera, F. Giralt, and A. Arenas, “Self-similar community structure in a network of human interactions,” Physical Review E, vol. 68, no. 6, Article ID 065103, 4 pages, 2003.