Thresholds for virus spread on networks

Annals of Applied Probability

Volumn 18, Issue 2, 2008, Pages 359-378

  Draief, Moez ^a   Ganesh, Ayalvadi ^b,d   Massoulí, Laurent ^c,e  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b MICROSOFT RESEARCH   (United States)

^c Thomson Research ^*

^d MICROSOFT RESEARCH   (United Kingdom)

^e FCA UNESP   (Brazil)

Author keywords

Epidemic threshold; Giant component; Random graphs; Reed frost epidemic; Spectral radius

Indexed keywords

EID: 48849111795     PISSN: 10505164     EISSN: 10505164     Source Type: Journal    
DOI: 10.1214/07-AAP470     Document Type: Article

References (26)

1. ALON, N. and SPENCER, J. H. (2000). The Probabilistic Method. Wiley, New York. MR1885388
2. BALL, F. (1983). A threshold theorem for the Reed-Frost chain-binomial epidemic. J. Appl. Probab. 20 153-157. MR0688089
3. BALL, F., MOLLISON, D. and SCALIA-T OMBA, G. (1997). Epidemics with two levels of mixing. Ann. Appl. Probab. 7 46-89. MR 1428749
4. BARABÁSI, A.-L. and ALBERT, R. (1999). Emergence of scaling in random networks. Science 286 509-512. MR2091634
5. BARBOUR, A. D. and UTEV, S. (2004). Approximating the Reed-Frost epidemic process. Stock Proc. Appl. 113 173-197. MR2087957
6. BOLLOBÁS, B. (2001). Random Graphs. Cambridge Univ. Press. MR 1864966
7. BOLLOBÁS, B., JANSON, S. and RIORDAN, O. (2007). The phase transition in inhomogeneous random graphs. Random Structures Algorithms 31 3-122.
8. BOLLOBÁS, B. and RIORDAN, O. (2004). The diameter of a scale-free random graph. Combinatorica 4 5-34. MR2057681
9. BERGER, N., BORGS, C., CHAYES, J. and SABERI, A. (2005). On the spread of viruses on the internet. In Proc. Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms 301-310. SIAM, Philadelphia.
10. CHUNG, F. and LU, L. (2002). Connected components in random graphs with given degree sequences. Ann. Combinatorics 6 125-145. MR1955514
11. CHUNG, F. and LU, L. (2003). The average distances in random graphs with given expected degrees. Internet Math. 1 91-114. MR2076728
12. CHUNG, F., LU, L. and VU, V. (2003). Eigenvalues of random power law graphs. Ann. Combinatorics 7 21-33. MR1984643
13. COSTA, M., CASTRO, M., CROWCROFT, J., ROWSTRON, A., ZHOU, L., ZHANG, L. and BARHAM, P. (2005). Vigilante: End-to-end containment of Internet worms. In Proc. Twentieth ACM Symp. on Operating Systems Principles 133-147. ACM Press, New York.
14. ERDOS, P. and RENYI, A. (1960). On the evolution of random graphs. Mat Kutato Int. Közl 5 17-60. MR0125031
15. FALOUTSOS, M., FALOUTSOS, P. and FALOUTSOS, C. (2003). Power laws and the AS-level Internet topology. IEEE/ACM Trans. Netw. 11 514-524.
16. GANESH, A., MASSOULIÉ, L. and TOWLEY, D. (2005). The effect of network topology on the spread of epidemics. In Proceedings IEEE Infocom.
17. JANSON, S., LUCZAK, T. and RUCIÑSKI, A. (2000). Random Graphs. Wiley, New York. MR1782847
18. KERMACK, W. O. and MCKENDRICK, A. G. (1927). A contribution to the mathematical theory of epidemics. Proc. Roy. Soc. Lond. A 115 700-721.
19. LEFEVRE, C. and UTEV, S. (1995). Poisson approximation for the final state of a generalized epidemic process. Ann. Probab. 23 1139-1162. MR1349165
20. LOVÁSZ, L. and SZEGEDY, B. (2004). Limits of dense graph sequences. Technical Report TR-2004-79, Microsoft Research.
21. MOLLOY, M. and REED, B. A. (1995). A critical point for random graphs with a given degree sequence. Random Structures Algorithms 6 161-180. MR1370952
22. MOLLOY, M. and REED, B. A. (1998). The size of the largest component of a random graph on a fixed degree sequence. Combin. Probab. Comput. 7 295-306. MR1664335
23. PASTOR-SATORRAS, R. and VESPIGNANI, A. (2001). Epidemic spreading in scale-free networks. Phys. Rev. Lett. 86 3200-3203.
24. PASTOR-SATORRAS, R. and VESPIGNANI, A. (2002). Epidemic dynamics in finite scale-free networks. Phys. Rev. E 65.
25. WEAVER, N., PAXSON, V., STAMFORD, S. and CUNNINGHAM, R. (2003). A taxonomy of computer worms. In ACM Workshop on Rapid Malcode (WORM) 11-18. ACM Press, New York.
26. WILLIAMSON, M. M. (2002). Throttling viruses: Restricting propagation to defeat malicious mobile code. In Proc. 18th Annual Computer Security Applications Conference 1-61. IEEE Comput. Soc., Washington.