Thresholds for virus spread on networks

ACM International Conference Proceeding Series

Volumn 180, Issue , 2006, Pages

  Draief, Moez ^a   Ganesh, Ayalvadi ^b   Massoulié, Laurent ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b MICROSOFT RESEARCH   (United Kingdom)

Author keywords

Largest connected component; Random graphs; SIR epidemic; Spectral radius

Indexed keywords

GRAPH THEORY; MATHEMATICAL MODELS; NETWORK SECURITY; PARAMETER ESTIMATION; POPULATION DYNAMICS; RANDOM PROCESSES;

LARGEST CONNECTED COMPONENTS; NETWORK TOPOLOGY; RANDOM GRAPHS; SIR EPIDEMICS; SPECTRAL RADIUS;

COMPUTER VIRUSES;

EID: 34748884339     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1190095.1190160     Document Type: Conference Paper

References (20)

1. N. Alon and J.H. Spencer. The Probabilistic Method. Wiley-Interscience in Discrete Mathematics and Opimization, 2000.
2. F. Ball, D. Mollison, and G. Scalia-Tomba. Epidemics with two levels of mixing. Ann. Appl. Probab., 7:46-89, 1997.
3. A.-L. Barabási and R., Albert. Emergence of scaling in random networks. Science, 286:509-512, 1999.
4. A.D. Barbour and S. Utev. Approximating the reed-frost epidemic process. Stock. Proc. Applications, 113:173-197, 2004.
5. B. Bollobás. Random Graphs. Cambridge University Press, 2001.
6. B. Bollobas and O. Riordan. The diameter of a scale-free random graph. Combinatorica, 4:5-34, 2004.
7. F. Chung and L. Lu. Connected components in random graphs with given degree sequences. Annals of Combinatorics, 6:125-145, 2002.
8. F. Chung and L. Lu. The average distances in random graphs with given expected degrees. Internet Mathematics, 1:91-114, 2003.
9. F. Chung, L. Lu, and V. Vu. Eigenvalues of random power law graphs. Annals of Combinatorics, 7:21-33, 2003.
10. M. Costa, M. Castro, J. Crowcroft, A. Rowstron, L. Zhou, L. Zhang, and P. Barham. Vigilante: end-to-end containment of internet worms. Proc. SOSP, 2005.
11. P. Erdös and A. Rényi. On the evolution of random graphs. Mat Kutato Int. Közl, 5:17-60, 1960.
12. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. Proc. ACM Sigcomm, 1999.
13. P. Jagers. Branching Processes with Biological Applications. Wiley Series in Probability and Mathematical Statistics, 1975.
14. S. Janson, T. Luczak, and A. Ruciriski. Random Graphs. Wiley-Interscience in Discrete Mathematics and Opimization, 2000.
15. W. O. Kermack and A. G. Mc-Kendrick. A contribution to the mathematical theory of epidemics. Proc. Roy. Soc. Lond. A, 115:700-721, 1927.
16. C. Lefevre and S. Utev. Poisson approximation for the final state of a generalized epidemic process. Annals of Probability, 23(3):1139-1162, 1995.
17. M. Molloy and B. A. Reed. A critical point for random graphs with a given degree sequence. Random Structures and Algorithms, 6:161-180, 1995.
18. M. Molloy and B. A. Reed. The size of the largest component of a, random graph on a fixed degree sequence. Combinatorics, Probability and Computing, 7:295-306, 1998.
19. N. Weaver, V. Paxson, S. Stamford, and R. Cunningham. A taxonomy of computer worms. Workshop on Rapid Malcode (WORM), 2003.
20. M. M. Williamson. Throttling viruses: restricting propagation to defeat malicious mobile code. ACSAC, 2002.