# Cascading Failures in Interdependent Networks with Multiple Supply-Demand Links and Functionality Thresholds

@article{DiMuro2017CascadingFI, title={Cascading Failures in Interdependent Networks with Multiple Supply-Demand Links and Functionality Thresholds}, author={M. A. Di Muro and Lucas D. Valdez and H. H. Arag{\~a}o R{\^e}go and Sergey V. Buldyrev and Harry Eugene Stanley and Lidia A. Braunstein}, journal={Scientific Reports}, year={2017}, volume={7} }

Various social, financial, biological and technological systems can be modeled by interdependent networks. It has been assumed that in order to remain functional, nodes in one network must receive the support from nodes belonging to different networks. So far these models have been limited to the case in which the failure propagates across networks only if the nodes lose all their supply nodes. In this paper we develop a more realistic model for two interdependent networks in which each node…

## 26 Citations

### Asymmetric interdependent networks with multiple-dependence relation.

- Computer SciencePhysical review. E
- 2020

A two-layered asymmetric interdependent network (AIN) model is proposed to address the robustness of interdependent networks with multiple-dependence (MD) relation, and a heuristic theory based on message-passing approach is developed to understand the structural feature of inter dependent networks.

### Survival Traffic Ratio Analysis for Cascading Failure in Interdependent Networks

- Computer Science2019 20th Asia-Pacific Network Operations and Management Symposium (APNOMS)
- 2019

A new measure for the impacts of cascading failures in interdependent networks is proposed that adds information about traffic paths, expressing the routes conveying traffic on a telecommunication network, to the existing model and defines the survival traffic ratio as the ratio of the surviving capacity of traffic which tele communication network can ensure after the cascading failure has occurred.

### Cascading failures on interdependent networks with star dependent links

- Computer Science, Physics
- 2019

### Control methods for network dynamics and criticality phenomena

- Engineering
- 2020

The main contributions of this thesis are the proposal of a vulnerability analysis framework to study network influence on critical phenomena and the design of a control framework combining Network theory with Markov Decision Processes and Stochastic Games in order to choose best strategies to reduce the impact of cascading failures.

### Cascading failures in complex networks

- EngineeringJ. Complex Networks
- 2020

This review summarizes recent progress on models developed based on physics and complex network science to understand the mechanisms, dynamics and overall impact of cascading failures and presents models for cascading failure in single networks and interdependent networks.

### Graph Metrics for Network Robustness—A Survey

- Computer ScienceMathematics
- 2021

A comparative overview of several novel graph metrics for assessing important topological robustness features of large complex networks is provided, and a conceptual tool set is outlined in order to facilitate their future adoption by Internet research and practice but also other areas of network science.

### A Boolean Networks Approach to Modeling and Resilience Analysis of Interdependent Critical Infrastructures

- BusinessComput. Aided Civ. Infrastructure Eng.
- 2018

In this article, we propose a dynamic Boolean network‐type mathematical representation of networked critical infrastructures under stress. Our formulation is obtained as a threshold‐based…

### Insights into Bootstrap Percolation: Its Equivalence with k-core Percolation and the Giant Component

- MathematicsPhysical review. E
- 2019

This manuscript provides a rigorous analysis that shows that for any degree and threshold distributions heterogeneous bootstrap percolation can be mapped into heterogeneous k-core percolations and vice versa, if the functionality thresholds in both processes satisfy a complementary relation.

### Graph Metrics for Internet Robustness - A Survey

- Computer ScienceArXiv
- 2021

This survey provides a comparative overview of several novel graph metrics for assessing important topological robustness features of large complex networks such as the Internet, and presents their strengths and limitations.

## References

SHOWING 1-10 OF 45 REFERENCES

### Catastrophic cascade of failures in interdependent networks

- BusinessNature
- 2010

This work develops a framework for understanding the robustness of interacting networks subject to cascading failures and presents exact analytical solutions for the critical fraction of nodes that, on removal, will lead to a failure cascade and to a complete fragmentation of two interdependent networks.

### Optimal Allocation of Interconnecting Links in Cyber-Physical Systems: Interdependence, Cascading Failures, and Robustness

- Computer ScienceIEEE Transactions on Parallel and Distributed Systems
- 2012

This paper characterize the optimum inter-link allocation strategy against random attacks in the case where the topology of each individual network is unknown and shows that this strategy yields better performance compared to all possible strategies, including strategies using random allocation, unidirectional interlinks, etc.

### Interdependent networks with identical degrees of mutually dependent nodes.

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2011

The robustness of CCN increases with the broadness of their degree distribution, and the system undergoes a percolation transition at a certain fraction p=p(c), which is always smaller than p(c) for randomly coupled networks with the same P(k).

### Cascading Failures in Interdependent Lattice Networks: The Critical Role of the Length of Dependency Links

- Computer SciencePhysical review letters
- 2012

The study of cascading failures in a system composed of two interdependent square lattice networks A and B suggests that interdependent infrastructures embedded in Euclidean space become most vulnerable when the distance between interdependent nodes is in the intermediate range, which is much smaller than the size of the system.

### Robustness of a network formed by n interdependent networks with a one-to-one correspondence of dependent nodes.

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2012

This work develops an analytical framework for studying a network formed by n fully interdependent randomly connected networks, each composed of the same number of nodes N, and finds that the robustness of n coupled RR networks of degree k is dramatically higher compared to the n-coupled ER networks of thesame average degree k[over ¯]=k.

### Triple point in correlated interdependent networks.

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2013

This work presents dynamic equations for two interdependent networks that allow us to reproduce the failure cascade for an arbitrary pattern of interdependency, and finds a rich phase diagram in the plane p-α, with a triple point reminiscent of the triple point of liquids that separates a nonfunctional phase from two functional phases.

### Cascade of failures in coupled network systems with multiple support-dependent relations

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2011

Both networks become independent, and the model becomes equivalent to a random attack on a single Erdős-Rényi network, and is good agreement with the simulations.

### Recovery of Interdependent Networks

- Computer ScienceScientific reports
- 2016

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.

### Robustness of a Network of Networks

- MathematicsPhysical review letters
- 2011

A general analytical framework for studying percolation of n interdependent networks is developed and it is shown that for any tree of n fully dependent Erdős-Rényi networks, each of average degree k, the giant component is P∞ = p[1-exp(-kP∞)](n) where 1-p is the initial fraction of removed nodes.

### Inter-similarity between coupled networks

- Computer ScienceArXiv
- 2010

This work studies a system composed of an interdependent world wide port network and a world wide airport network and shows that well- connected ports tend to couple with well-connected airports, and introduces two quantities for measuring the level of inter-similarity.