Tolerance of scale-free networks against attack-induced cascades
Authors:
- 31 August 2005
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 72 (2) , 025104
Abstract
Scale-free networks can be disintegrated by attack on a single or a very few nodes through the process of cascading failures. By utilizing a prototype cascading model, we previously determined the critical value of the capacity parameter below which the network can become disintegrated due to attack on a single node. A fundamental question in network security, which has not been addressed previously but may be more important and of wider interest, is how to design networks of finite capacity that are safe against cascading breakdown. Here we derive an upper bound for the capacity parameter, above which the network is immune to cascading breakdown. Our theory also yields estimates for the maximally achievable network integrity via controlled removal of a small set of low-degree nodes. The theoretical results are confirmed numerically.Keywords
This publication has 18 references indexed in Scilit:
- Attack vulnerability of scale-free networks due to cascading breakdownPhysical Review E, 2004
- Cascade-based attacks on complex networksPhysical Review E, 2002
- Edge overload breakdown in evolving networksPhysical Review E, 2002
- Vertex overload breakdown in evolving networksPhysical Review E, 2002
- Comment on “Breakdown of the Internet under Intentional Attack”Physical Review Letters, 2001
- Breakdown of the Internet under Intentional AttackPhysical Review Letters, 2001
- Network Robustness and Fragility: Percolation on Random GraphsPhysical Review Letters, 2000
- Resilience of the Internet to Random BreakdownsPhysical Review Letters, 2000
- Error and attack tolerance of complex networksNature, 2000
- Emergence of Scaling in Random NetworksScience, 1999