Published 2005
| Published
Book Section - Chapter
Open
On the Spread of Viruses on the Internet
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)).
Additional Information
© 2004 SIAM. We thank Milena Mihail, Bobby Kleinberg and Oliver Riordan for useful discussions.Attached Files
Published - Berger2005p11457Proceedings_Of_The_Sixteenth_Annual_Acm-Siam_Symposium_On_Discrete_Algorithms.pdf
Files
Berger2005p11457Proceedings_Of_The_Sixteenth_Annual_Acm-Siam_Symposium_On_Discrete_Algorithms.pdf
Files
(652.2 kB)
Name | Size | Download all |
---|---|---|
md5:adc8ef6e5a22d8e21d51ac01de2dae75
|
652.2 kB | Preview Download |
Additional details
- Eprint ID
- 20235
- Resolver ID
- CaltechAUTHORS:20100930-122520007
- Created
-
2010-10-01Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field