The influence of the broadness of the degree distribution on network's robustness: comparing localized attack and random attack
arXiv:1504.06900 · doi:10.1103/PhysRevE.92.032122
Abstract
The stability of networks is greatly influenced by their degree distributions and in particular by their broadness. Networks with broader degree distributions are usually more robust to random failures but less robust to localized attacks. To better understand the effect of the broadness of the degree distribution we study here two models where the broadness is controlled and compare their robustness against localized attacks (LA) and random attacks (RA). We study analytically and by numerical simulations the cases where the degrees in the networks follow a Bi-Poisson distribution , and a Gaussian distribution with a normalization constant where . In the Bi-Poisson distribution the broadness is controlled by the values of , and , while in the Gaussian distribution it is controlled by the standard deviation, . We find that only for or , namely degrees obeying a pure Poisson distribution, LA and RA are the same but for all other cases networks are more vulnerable under LA compared to RA. For Gaussian distribution, with an average degree fixed, we find that when is smaller than the network is more vulnerable against random attack. However, when is larger than the network becomes more vulnerable against localized attack. Similar qualitative results are also shown for interdependent networks.
arXiv comment8 pages, 10 figures
References in corpus (28)
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Error and attack tolerance of complex networks
- Catastrophic cascade of failures in interdependent networks
- Synchronization in complex networks
- The spread of epidemic disease on networks
- The structure and dynamics of multilayer networks
- Network robustness and fragility: Percolation on random graphs
- Resilience of the Internet to random breakdowns
- Self-similarity of complex networks
- Influence maximization in complex networks through optimal percolation
- Mitigation of Malicious Attacks on Networks
- Network Physiology reveals relations between network topology and physiological function
- Robustness of interdependent networks under targeted attack
- Avalanche Collapse of Interdependent Network
- Abrupt transition in the structural formation of interconnected networks
- The extreme vulnerability of interdependent spatially embedded networks
- Percolation in real interdependent networks
- Spatially localized attacks on interdependent networks: the existence of a finite critical attack size
- Improved El Niño-Forecasting by Cooperativity Detection
- Percolation of localized attack on complex networks
- Designing optimal transport networks
- Percolation of a general network of networks
- Percolation of partially interdependent networks under targeted attack
- Structure of shells in complex networks
- Two-Peak and Three-Peak Optimal Complex Networks
- Evolution of robust network topologies: Emergence of central backbones
- Efficient learning strategy of Chinese characters based on network approach
Cited by in corpus (13)
- Percolation on complex networks: Theory and application
- Cascading Failures in Complex Networks
- Structural Robustness of Complex Networks: A Survey of A Posteriori Measures
- -core percolation on complex networks: Comparing random, localized and targeted attacks
- The interdependent network of gene regulation and metabolism is robust where it needs to be
- Spreading of localized attacks in spatial multiplex networks
- Asymmetry in interdependence makes a multilayer system more robust against cascading failures
- Cascading failures in coupled networks with both inner-dependency and inter-dependency links
- The structure of networks that evolve under a combination of growth, via node addition and random attachment, and contraction, via random node deletion
- Percolation of networks with directed dependency links
- Phase transition in evolving networks that combine preferential attachment and random node deletion
- The healing strategy by prioritizing minimum degree against localized attacks on interdependent spatially embedded networks
- Cascading failures in anisotropic interdependent networks of spatial modular structures