OPTIMIZATION OF SCALE-FREE NETWORK FOR RANDOM FAILURES
- 20 June 2006
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in Modern Physics Letters B
- Vol. 20 (14), 815-820
- https://doi.org/10.1142/s0217984906010883
Abstract
It has been found that the networks with scale-free degree distribution are very resilient for random failures. The purpose of this work is to determine the network design guidelines which maximize the network robustness for random failures when the average number of links per node of the network is constant. The optimal value of the degree distribution exponent and the minimum connectivity to different network sizes are given in this paper. Finally, the optimization strategy on how to improve the evolving network robustness is given.Keywords
This publication has 8 references indexed in Scilit:
- On random graphs. I.Publicationes Mathematicae Debrecen, 2022
- Optimization of robustness of complex networksZeitschrift für Physik B Condensed Matter, 2004
- Evolution and Structure of the InternetPublished by Cambridge University Press (CUP) ,2004
- The Structure and Function of Complex NetworksSIAM Review, 2003
- Statistical mechanics of complex networksReviews of Modern Physics, 2002
- Breakdown of the Internet under Intentional AttackPhysical Review Letters, 2001
- Resilience of the Internet to Random BreakdownsPhysical Review Letters, 2000
- Collective dynamics of ‘small-world’ networksNature, 1998