# Resilience of the internet to random breakdowns

@article{Cohen2000ResilienceOT, title={Resilience of the internet to random breakdowns}, author={Cohen and Erez and ben-Avraham and Havlin}, journal={Physical review letters}, year={2000}, volume={85 21}, pages={ 4626-8 } }

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… Expand

#### Figures from this paper

#### 1,880 Citations

Percolation on sparse networks

- Computer Science, Medicine
- Physical review letters
- 2014

Percolation is reformulate as a message passing process and the resulting equations can be used to calculate the size of the percolating cluster and the average cluster size, finding them to be highly accurate when compared with direct numerical simulations. Expand

Parameters Affecting the Resilience of Scale-Free Networks to Random Failures

- Computer Science
- ArXiv
- 2005

It is shown that, in a power-law network approximating the Internet's reported distribution, when the probability of deletion of each node is 0.5 only about 25% of the surviving nodes in the network remain connected in a giant component, and the giant component does not persist beyond a critical failure rate of 0.9. Expand

Percolation processes and wireless network resilience

- Computer Science
- 2008 Information Theory and Applications Workshop
- 2008

This work model this cascading failures problem in large-scale wireless networks, and shows that it is equivalent to a degree-dependent site percolation on random geometric graphs, and obtains analytical conditions for cascades. Expand

Structural properties of scale‐free networks

- Mathematics
- 2005

Many networks have been reported recently to follow a scalefre degree distribution in which the fraction of sites having k connections follows a power law: P (k) = k . In this chapter we study the… Expand

Effect of random failures on traffic in complex networks

- Geography, Engineering
- SPIE International Symposium on Fluctuations and Noise
- 2007

We study the effect of random removal of nodes in networks on the maximum capability to deliver information in communication processes. Measuring the changes on the onset of congestion, we observe… Expand

4 Structural Properties of Scale-Free Networks

Many networks have been reported recently to follow a scale-free degree distribution in which the fraction of sites having connections follows a power law: . In this chapter we study the structural… Expand

Robustness of a Network of Networks

- Computer Science, Physics
- Physical review letters
- 2011

A general analytical framework for studying percolation of n interdependent networks is developed and it is shown that for any tree of n fully dependent Erdős-Rényi networks, each of average degree k, the giant component is P∞ = p[1-exp(-kP∞)](n) where 1-p is the initial fraction of removed nodes. Expand

A model of Internet topology using k-shell decomposition

- Computer Science, Physics
- Proceedings of the National Academy of Sciences
- 2007

This analysis uses information on the connectivity of the network shells to separate, in a unique (no parameters) way, the Internet into three subcomponents: a nucleus that is a small, very well connected globally distributed subgraph; a fractal subcomponent that is able to connect the bulk of the Internet without congesting the nucleus, with self-similar properties and critical exponents predicted from percolation theory. Expand

Scale-free networks resistant to intentional attacks

- Physics
- 2007

We study the detailed mechanism of the failure of scale-free networks under intentional attacks. Although it is generally accepted that such networks are very sensitive to targeted attacks, we show… Expand

Optimization of network structure to random failures

- Computer Science, Physics
- 2006

It is found that a network with a small quantity of hub nodes, high degree of clustering, may be much more resilient to perturbations than a random network and the optimal network is one kind of highly heterogeneous networks. Expand

#### References

SHOWING 1-10 OF 26 REFERENCES

- 2000

Nature (London) 406

- 378
- 2000

Phys

- Rev. Lett. 84, 3201
- 2000

and F

- Leyvraz, e-print cond-mat/0005139
- 2000

electronic preprint

- cond-mat/0005139
- 2000

Comput

- Commun. Rev. 29, 251
- 1999

Comput. Commun. Rev

- Comput. Commun. Rev
- 1999

Nature (London) 401

- 131
- 1999

Nature (London) 401

- 130
- 1999