Catastrophic cascade of failures in interdependent networks

@article{Havlin2010CatastrophicCO,
  title={Catastrophic cascade of failures in interdependent networks},
  author={Shlomo Havlin and Nuno A. M. Ara{\'u}jo and Sergey V. Buldyrev and C. S. Dias and Roni Parshani and Gerald Paul and Harry Eugene Stanley},
  journal={Nature},
  year={2010},
  volume={464},
  pages={1025-1028}
}
Complex networks have been studied intensively for a decade, but research still focuses on the limited case of a single, non-interacting network. Modern systems are coupled together and therefore should be modelled as interdependent networks. A fundamental property of interdependent networks is that failure of nodes in one network may lead to failure of dependent nodes in other networks. This may happen recursively and can lead to a cascade of failures. In fact, a failure of a very small… 
Strategy for stopping failure cascades in interdependent networks
Failure cascade in interdependent network with traffic loads
TLDR
The findings highlight the need to consider the load and coupling preference when designing robust interdependent networks and it is necessary to take actions in the early stage of the failure cascade to decrease the losses caused by the large-scale breakdown of infrastructure networks.
Vulnerability and controllability of networks of networks
Cascading failures in coupled networks: The critical role of node-coupling strength across networks
TLDR
The percolation framework is used to study the robustness of interdependent networks with weak node-coupling strength across networks analytically and numerically, where the node-doubling strength is controlled by an introduced parameter α.
Recovery of Interdependent Networks
TLDR
A recovery strategy for nodes is introduced and an analytic and numerical framework for studying the concurrent failure and recovery of a system of interdependent networks based on an efficient and practically reasonable strategy is developed.
Universal behavior of cascading failures in interdependent networks
TLDR
A self-consistent theory enabling the systematic analysis of cascading failures in networks and encompassing a broad range of dynamical systems, from epidemic spreading, to birth–death processes, to biochemical and regulatory dynamics is presented.
Breakdown of interdependent directed networks
TLDR
A theoretical framework based on generating functions and percolation theory is developed and found that for interdependent Erdős–Rényi networks the directionality within each network increases their vulnerability and exhibits hybrid phase transitions, and the robustness of interdependent heterogeneous networks increases, whereas that of inter dependent homogeneous networks with strong coupling strengths decreases with in-degree and out-degree correlations.
Spreading of Failures in Interdependent Networks
TLDR
The focus of this chapter is on the specific mechanisms occurring in interdependent systems, where components of one system cannot function without components of the other, as in the case of a communication tower which needs power from the nearby power station.
...
...

References

SHOWING 1-10 OF 85 REFERENCES
Cascade-based attacks on complex networks.
  • A. Motter, Y. Lai
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2002
TLDR
It is demonstrated that the heterogeneity of these networks makes them particularly vulnerable to attacks in that a large-scale cascade may be triggered by disabling a single key node.
Interdependent networks: reducing the coupling strength leads to a change from a first to second order percolation transition.
TLDR
It is shown both analytically and numerically that reducing the coupling between the networks leads to a change from a first order percolation phase transition to a second orderpercolation transition at a critical point.
Critical phenomena in complex networks
TLDR
A wide range of critical phenomena in equilibrium and growing networks including the birth of the giant connected component, percolation, $k$-core percolations, phenomena near epidemic thresholds, condensation transitions,critical phenomena in spin models placed on networks, synchronization, and self-organized criticality effects in interacting systems on networks are mentioned.
Modelling interdependent infrastructures using interacting dynamical models
TLDR
Averaging over many configurations of perturbed electrical network, results point to a sizeable amplification of the effects of faults on the electrical network on the communication network, also in the case of a moderate coupling between the two networks.
Error and attack tolerance of complex networks
Julius Edgar Lilienfeld Prize Talk: Catastrophic cascade of failures in interdependent networks
TLDR
The critical fraction of nodes that upon removal will lead to a failure cascade and to a complete fragmentation of two interdependent networks is calculated and the broader the distribution, the more vulnerable the networks become to random failures.
Evolution of networks
TLDR
The recent rapid progress in the statistical physics of evolving networks is reviewed, and how growing networks self-organize into scale-free structures is discussed, and the role of the mechanism of preferential linking is investigated.
The structure and dynamics of networks
  • M. Newman
  • Computer Science
    Princeton studies in complexity
  • 2006
TLDR
The degree distribution, twopoint correlations, and clustering are the studied topological properties and an evolution of networks is studied to shed light on the influence the dynamics has on the network topology.
Collective dynamics of ‘small-world’ networks
TLDR
Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Self-similarity of complex networks
TLDR
A power-law relation is identified between the number of boxes needed to cover the network and the size of the box, defining a finite self-similar exponent to explain the scale-free nature of complex networks and suggest a common self-organization dynamics.
...
...