Resilience of the internet to random breakdowns

Reuven Cohen, Keren Erez, Daniel Ben-Avraham, Shlomo Havlin

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

15 Scopus citations


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. 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, pr, that needs to be removed before the network disintegrates. We show analytically and numerically that for α ≤ 3 the transition never takes place, unless the network is finite. In the special case of the physical structure of the Internet (α = 2.5), we find that it is impressively robust, with pc > 0.99.

Original languageEnglish
Title of host publicationThe Structure and Dynamics of Networks
PublisherPrinceton University Press
Number of pages3
ISBN (Electronic)9781400841356
ISBN (Print)0691113572, 9780691113579
StatePublished - 23 Oct 2011

Bibliographical note

Publisher Copyright:
© 2000 The American Physical Society.


Dive into the research topics of 'Resilience of the internet to random breakdowns'. Together they form a unique fingerprint.

Cite this