Optimization of network robustness to random breakdowns

Gerald Paul, Sameet Sreenivasan, Shlomo Havlin and H. Eugene Stanley

Physica A: Statistical Mechanics and its Applications, 2006, vol. 370, issue 2, 854-862

Abstract: We study network configurations that provide optimal robustness to random breakdowns for networks with a given number of nodes N and a given cost—which we take as the average number of connections per node 〈k〉. We find that the network design that maximizes fc, the fraction of nodes that are randomly removed before global connectivity is lost, consists of q=[(〈k〉-1)/〈k〉]N high degree nodes (“hubs”) of degree 〈k〉N and N-q nodes of degree 1. Also, we show that 1-fc approaches 0 as 1/N—faster than any other network configuration including scale-free networks. We offer a simple heuristic argument to explain our results.

Keywords: Network robustness; Random breakdown (search for similar items in EconPapers)
Date: 2006
References: View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437106002457
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:370:y:2006:i:2:p:854-862

DOI: 10.1016/j.physa.2006.02.044

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().