Optimization of Robustness and Connectivity in Complex Networks
- 13 February 2003
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 90 (6), 068701
- https://doi.org/10.1103/physrevlett.90.068701
Abstract
Scale-free networks rely on a relatively small number of highly connected nodes to achieve a high degree of interconnectivity and robustness to random failure, but suffer from a high sensitivity to directed attack. In this paper we describe a parametrized family of networks and analyze their connectivity and sensitivity, identifying a network that has an interconnectedness closer to that of a scale-free network, a robustness to attack closer to that of an exponential network, and a resistance to failure better than that of either of those networks.Keywords
This publication has 15 references indexed in Scilit:
- Random graph models of social networksProceedings of the National Academy of Sciences of the United States of America, 2002
- Complexity and fragility in ecological networksProceedings Of The Royal Society B-Biological Sciences, 2001
- Random graphs with arbitrary degree distributions and their applicationsPhysical Review E, 2001
- Exploring complex networksNature, 2001
- Erratum: correction: Error and attack tolerance of complex networksNature, 2001
- Resilience of the Internet to Random BreakdownsPhysical Review Letters, 2000
- The large-scale organization of metabolic networksNature, 2000
- Error and attack tolerance of complex networksNature, 2000
- Emergence of Scaling in Random NetworksScience, 1999
- Diameter of the World-Wide WebNature, 1999