Epidemic thresholds in real networks

ABSTRACT

How will a virus propagate in a real network? How long does it take to disinfect a network given particular values of infection rate and virus death rate? What is the single best node to immunize? Answering these questions is essential for devising network-wide strategies to counter viruses. In addition, viral propagation is very similar in principle to the spread of rumors, information, and “fads,” implying that the solutions for viral propagation would also offer insights into these other problem settings. We answer these questions by developing a nonlinear dynamical system (NLDS) that accurately models viral propagation in any arbitrary network, including real and synthesized network graphs. We propose a general epidemic threshold condition for the NLDS system: we prove that the epidemic threshold for a network is exactly the inverse of the largest eigenvalue of its adjacency matrix. Finally, we show that below the epidemic threshold, infections die out at an exponential rate. Our epidemic threshold model subsumes many known thresholds for special-case graphs (e.g., Erdös--Rényi, BA powerlaw, homogeneous). We demonstrate the predictive power of our model with extensive experiments on real and synthesized graphs, and show that our threshold condition holds for arbitrary graphs. Finally, we show how to utilize our threshold condition for practical uses: It can dictate which nodes to immunize; it can assess the effects of a throttling policy; it can help us design network topologies so that they are more resistant to viruses.

REFERENCES

• 1: Anderson, R. M. and May, R. M. 2002. Infectious diseases of humans: Dynamics and control. Oxford Press, Oxford.
• 2: Bailey, N. 1975. The Mathematical Theory of Infectious Diseases and its Applications. Griffin, London.
• 3: Barabási, A.-L. and Albert, R. 1999. Emergence of scaling in random networks. Science 286, 509--512.
• 4: Noam Berger , Christian Borgs , Jennifer T. Chayes , Amin Saberi, On the spread of viruses on the internet, Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, January 23-25, 2005, Vancouver, British Columbia
• 5: Boguñá, M. and Pastor-Satorras, R. 2002. Epidemic spreading in correlated complex networks. Physical Review E 66, 047104.
• 6: Linda Briesemeister , Patrick Lincoln , Phillip Porras, Epidemic profiles and defense of scale-free networks, Proceedings of the 2003 ACM workshop on Rapid malcode, October 27-27, 2003, Washington, DC, USA [doi>10.1145/948187.948200]
• 7: Chung, F., Lu, L., and Vu, V. 2003a. Eigenvalues of random power law graphs. Annals of Combinatorics 7, 21--33.
• 8: Chung, F., Lu, L., and Vu, V. 2003b. Spectra of random graphs with given expected degrees. PNA 100, 11 (May 27), 6313--6318.
• 9: Cohen, R., Havlin, S., and ben Avraham, D. 2003. Efficient immunization strategies for computer networks and populations. Physical Review Letters 91 (Dec.), 34.
• 10: Eguiluz, V. M. and Klemm, K. 2002. Epidemic threshold in structured scale-free networks. arXiv:cond-mat/02055439.
• 11: Erdös, P. and Rényi, A. 1960. On the evolution of random graphs. In Publication 5. Institute of Mathematics, Hungarian Academy of Sciences, Hungary. 17--61.
• 12: Michalis Faloutsos , Petros Faloutsos , Christos Faloutsos, On power-law relationships of the Internet topology, Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, p.251-262, August 30-September 03, 1999, Cambridge, Massachusetts, United States
• 13: Ganesh, A., Massoulié, L., and Towsley, D. 2005. The effect of network topology on the spread of epidemics. In INFOCOM.
• 14: Hayashi, Y., Minoura, M., and Matsukubo, J. 2003. Recoverable prevalence in growing scale-free networks and the effective immunization. arXiv:cond-mat/0305549 v2.
• 15: Herbert W. Hethcote, The Mathematics of Infectious Diseases, SIAM Review, v.42 n.4, p.599-653, Dec. 2000 [doi>10.1137/S0036144500371907]
• 16: Hethcote, H. W. and Yorke, J. A. 1984. Gonorrhea Transmission Dynamics and Control. Vol. 56. Springer. Lecture Notes in Biomathematics.
• 17: Hirsch, M. W. and Smale, S. 1974. Differential Equations, Dynamical Systems, and Linear Algebra. Academic Press, New York.
• 18: Kephart, J. O. and White, S. R. 1991. Directed-graph epidemiological models of computer viruses. In Proceedings of the 1991 IEEE Computer Society Symposium on Research in Security and Privacy. 343--359.
• 19: Jeffrey O. Kephart , Steve R. White, Measuring and Modeling Computer Virus Prevalence, Proceedings of the 1993 IEEE Symposium on Security and Privacy, p.2, May 24-26, 1993
• 20: Ravi Kumar , Prabhakar Raghavan , Sridhar Rajagopalan , Andrew Tomkins, Trawling the Web for emerging cyber-communities, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.31 n.11-16, p.1481-1493, May 17, 1999
• 21: C. R. MacCluer, The Many Proofs and Applications of Perron's Theorem, SIAM Review, v.42 n.3, p.487-498, Sept. 2000 [doi>10.1137/S0036144599359449]
• 22: Madar, N., Kalisky, T., Cohen, R., ben Avraham, D., and Havlin, S. 2004. Immunization and epidemic dynamics in complex networks. Eur. Phys. J. B 38, 2, 269--276.
• 23: Martin, H., Ed. 2002. The Virus Bulletin: Independent Anti-Virus Advice. World Wide Web, http://www.virusbtn.com. Ongoing.
• 24: McKendrick, A. G. 1926. Applications of mathematics to medical problems. In Proceedings of Edin. Math. Society. Vol. 14. 98--130.
• 25: Alberto Medina , Anukool Lakhina , Ibrahim Matta , John Byers, BRITE: Universal Topology Generation from a User''s Perspective, Boston University, Boston, MA, 2001
• 26: Moreno, Y., Pastor-Satorras, R., and Vespignani, A. 2002. Epidemic outbreaks in complex heterogeneous networks. The European Physical Journal B 26, 521--529.
• 27: Newman, M. E. J., Forrest, S., and Balthrop, J. 2002. Email networks and the spread of computer viruses. Physical Review E 66, 035101(R).
• 28: Pastor-Satorras, R. and Vespignani, A. 2001a. Epidemic dynamics and endemic states in complex networks. Physical Review E 63, 066117.
• 29: Pastor-Satorras, R. and Vespignani, A. 2001b. Epidemic spreading in scale-free networks. Physical Review Letters 86, 14 (2 April), 3200--3203.
• 30: Pastor-Satorras, R. and Vespignani, A. 2002a. Epidemic dynamics in finite size scale-free networks. Physical Review E 65, 035108.
• 31: Pastor-Satorras, R. and Vespignani, A. 2002b. Epidemics and immunization in scale-free networks. In Handbook of Graphs and Networks: From the Genome to the Internet, S. Bornholdt and H. G. Schuster, Eds. Wiley-VCH, Berlin.
• 32: Pedro Domingos , Matt Richardson, Mining the network value of customers, Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, p.57-66, August 26-29, 2001, San Francisco, California [doi>10.1145/502512.502525]
• 33: Matei Ripeanu , Adriana Iamnitchi , Ian Foster, Mapping the Gnutella Network, IEEE Internet Computing, v.6 n.1, p.50-57, January 2002 [doi>10.1109/4236.978369]
• 34: Chenxi Wang , J. C. Knight , M. C. Elder, On computer viral infection and the effect of immunization, Proceedings of the 16th Annual Computer Security Applications Conference, p.246, December 11-15, 2000
• 35: Wang, Y., Chakrabarti, D., Wang, C., and Faloutsos, C. 2003. Epidemic spreading in real networks: An eigenvalue viewpoint. In SRDS.

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.1 MODELS AND PRINCIPLES
      H.1.1 Systems and Information Theory

General Terms:
Reliability, Security

Keywords:
Viral propagation, eigenvalue, epidemic threshold