Resilience of the internet to random breakdowns

By R. Cohen, Keren Erez, Daniel ben-Avraham, Shlomo Havlin. Physical Review Letters, 2000

2,181 citations recorded by the source corpus.

A common property of many large networks, including the Internet, is that the connectivity of the various nodes follows a scale-free power-law distribution, P(k) = ck(-alpha). We study the stability of such networks with respect to crashes, such as random removal of sites. Our approach, based on percolation theory, leads to a general condition for the critical fraction of nodes, p(c), that needs to be removed before the network disintegrates. We show analytically and numerically that for alpha</=3 the transition never takes place, unless the network is finite. In the special case of the physical structure of the Internet (alpha approximately 2.5), we find that it is impressively robust, with p(c)>0.99.

Subfields: Mathematical Physics, Statistical and Nonlinear Physics

View Paper: https://www.semanticscholar.org/paper/fb1921b1cfb456c24e71f97df0d009dc21803f06

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Mathematical Physics

  1. Mark Newman
  2. Remco van der Hofstad
  3. Alessandro Vespignani
  4. Albert-László Barabási
  5. Romualdo Pastor-Satorras
  6. José Fernando Ferreira Mendes
  7. Sergey N. Dorogovtsev
  8. Alexander V. Goltsev

In Statistical and Nonlinear Physics

  1. Mark Newman
  2. Albert-László Barabási
  3. Santo Fortunato
  4. Marc Barthelemy
  5. M. A. Porter
  6. Olaf Sporns
  7. Alessandro Vespignani
  8. Remco van der Hofstad

Citations in the corpus