On the spread of viruses on the Internet

Noam Berger; Christian Borgs; Jennifer T. Chayes; Amin Saberi

On the spread of viruses on the Internet

Noam Berger
, Christian Borgs
, Jennifer T. Chayes
, Amin Saberi

California Institute of Technology
Microsoft Research
Georgia Institute of Technology

Research output: Contribution to conference › Paper › peer-review

166 Scopus citations

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

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 3 Good Health and Well-being

Cite this

@conference{1809c65867a04fa1a4ae66c90b421a94,

title = "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 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).",

author = "Noam Berger and Christian Borgs and Chayes, \{Jennifer T.\} and Amin Saberi",

year = "2005",

language = "English",

pages = "301--310",

note = "Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms ; Conference date: 23-01-2005 Through 25-01-2005",

}

TY - CONF

T1 - On the spread of viruses on the Internet

AU - Berger, Noam

AU - Borgs, Christian

AU - Chayes, Jennifer T.

AU - Saberi, Amin

PY - 2005

Y1 - 2005

N2 - 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).

AB - 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).

UR - https://www.scopus.com/pages/publications/20744442724

M3 - Paper

AN - SCOPUS:20744442724

SP - 301

EP - 310

T2 - Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms

Y2 - 23 January 2005 through 25 January 2005

ER -

On the spread of viruses on the Internet

Abstract

Conference

UN SDGs

Other files and links

Fingerprint

Cite this