Network Overload due to Massive Attacks
arXiv:1802.03901 · doi:10.1103/PhysRevE.97.052309
Abstract
We study the cascading failure of networks due to overload, using the betweenness centrality of a node as the measure of its load following the Motter and Lai model. We study the fraction of survived nodes at the end of the cascade as function of the strength of the initial attack, measured by the fraction of nodes , which survive the initial attack for different values of tolerance in random regular and Erdös-Renyi graphs. We find the existence of first order phase transition line on a plane, such that if the cascade of failures lead to a very small fraction of survived nodes and the giant component of the network disappears, while for , is large and the giant component of the network is still present. Exactly at the function undergoes a first order discontinuity. We find that the line ends at critical point ,in which the cascading failures are replaced by a second order percolation transition. We analytically find the average betweenness of nodes with different degrees before and after the initial attack, investigate their roles in the cascading failures, and find a lower bound for . We also study the difference between a localized and random attacks.
References in corpus (20)
- Statistical mechanics of complex networks
- Catastrophic cascade of failures in interdependent networks
- Random graphs with arbitrary degree distributions and their applications
- The spread of epidemic disease on networks
- Resilience of the Internet to random breakdowns
- Cascade-based attacks on complex networks
- Structural Vulnerability of the North American Power Grid
- Universal Behavior of Load Distribution in Scale-free Networks
- Scaling and percolation in the small-world network model
- A model for cascading failures in complex networks
- Cascade control and defense in complex networks
- Suppressing cascades of load in interdependent networks
- Bootstrap Percolation on Complex Networks
- Structure of shells in complex networks
- Heterogeneous-k-core versus Bootstrap Percolation on Complex Networks
- A High Robustness and Low Cost Model for Cascading Failures
- Cascading Failures in Interdependent Networks with Multiple Supply-Demand Links and Functionality Thresholds
- Cascading failures in interdependent networks with finite functional components
- Interdependent Lattice Networks in High Dimensions
- A study of cascading failures in real and synthetic power grid topologies using DC power flows
Cited by in corpus (10)
- Robustness and resilience of complex networks
- Cascading Failures in Complex Networks
- Resilience or Robustness: Identifying Topological Vulnerabilities in Rail Networks
- Scaling of percolation transitions on Erdös-Rényi networks under centrality-based attacks
- Abrupt transition due to non-local cascade propagation in multiplex systems
- Distribution of blackouts in the power grid and the Motter and Lai model
- Cascading failures in isotropic and anisotropic spatial networks induced by localized attacks and overloads
- Non-Markovian random walks characterize network robustness to nonlocal cascades
- Cascading traffic jamming in a two-dimensional Motter and Lai model
- Predicting the cascading dynamics in complex networks via the bimodal failure size distribution