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 a 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).
Original language | English |
---|---|
Pages | 301-310 |
Number of pages | 10 |
State | Published - 2005 |
Externally published | Yes |
Event | Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms - Vancouver, BC, United States Duration: 23 Jan 2005 → 25 Jan 2005 |
Conference
Conference | Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms |
---|---|
Country/Territory | United States |
City | Vancouver, BC |
Period | 23/01/05 → 25/01/05 |