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
- Mark Newman
- Remco van der Hofstad
- Alessandro Vespignani
- Albert-László Barabási
- Romualdo Pastor-Satorras
- José Fernando Ferreira Mendes
- Sergey N. Dorogovtsev
- Alexander V. Goltsev
In Statistical and Nonlinear Physics
- Mark Newman
- Albert-László Barabási
- Santo Fortunato
- Marc Barthelemy
- M. A. Porter
- Olaf Sporns
- Alessandro Vespignani
- Remco van der Hofstad
Citations in the corpus
- Analysis of a large-scale weighted network of one-to-one human communication (2007, background): “For such a rapidly decaying degree distribution the hubs are few, and therefore many properties of traditional scale-free networks, from anomalous diffusion [15] to error tolerance [16], are absent.”
- Mixing patterns in networks. (2002, background): “Examples include resilience to the deletion of network nodes [8, 9, 10, 11, 12], navigability or searchability of networks [13, 14, 15], community structure [16, 17, 18], and spectral properties [19, 20, 21].”
- Complexity and fragility in ecological networks (2000, background): “In fact, we can theoretically estimate the fraction of removed species, p c, required for food-web fragmentation from random removal (Cohen et al. 2001):”
- Reaction–diffusion processes and metapopulation models in heterogeneous networks (2007, background): “As connectivity fluctuations have been shown to have a large impact on the behaviour of several percolation and fermionic system”
- Network resilience (2020, background): “In most studies of network robustness, networks are treated as static and unweighted [1, 835, 14].”
- Random graph models of social networks (2002, background): “Simulations and analytic work have suggested that this could have an impact on the way in which communities operate , including the way information travels through the network and the robustness of networks to removal of actors [5] [6] [7].”
- Synchronization in scale-free dynamical networks: robustness and fragility (2001, background): “It is this inhomogeneous feature that makes a scale-free network error tolerant but vulnerable to attacks [16-19].”