Berger, Noam and Borgs, Christian and Chayes, Jennifer T. and Saberi, Amin (2005) On the Spread of Viruses on the Internet. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics , Philadelphia, pp. 301-310. ISBN 978-0-89871-585-9 http://resolver.caltech.edu/CaltechAUTHORS:20100930-122520007
![[img]](http://authors.library.caltech.edu/style/images/fileicons/application_pdf.png) |
PDF
- Published Version
See Usage Policy. 636Kb |
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20100930-122520007
Abstract
We analyze the contact process on random graphs generated according to the preferential attachment scheme as a model for the spread of viruses in the Internet. We show that any virus with a positive rate of spread from a node to its neighbors has a non-vanishing chance of becoming epidemic. Quantitatively, we discover an interesting dichotomy: for it virus with effective spread rate λ, if the infection starts at a typical vertex, then it develops into an epidemic with probability λ^Θ ((log (1/ λ)/log log (1/ λ))), but on average the epidemic probability is λ^(Θ (1)).
| Item Type: | Book Section |
|---|---|
| Additional Information: | © 2004 SIAM. We thank Milena Mihail, Bobby Kleinberg and Oliver Riordan for useful discussions. |
| Record Number: | CaltechAUTHORS:20100930-122520007 |
| Persistent URL: | http://resolver.caltech.edu/CaltechAUTHORS:20100930-122520007 |
| Related URLs: | |
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. |
| ID Code: | 20235 |
| Collection: | CaltechAUTHORS |
| Deposited By: | Tony Diaz |
| Deposited On: | 01 Oct 2010 22:27 |
| Last Modified: | 26 Dec 2012 12:29 |
Repository Staff Only: item control page
