Cascading Failures in Networks with Proximate Dependent Nodes

Abstract

We study the mutual percolation of a system composed of two interdependent random regular networks. We introduce a notion of distance to explore the effects of the proximity of interdependent nodes on the cascade of failures after an initial attack. We find a non-trivial relation between the nature of the transition through which the networks disintegrate and the parameters of the system, which are the degree of the nodes and the maximum distance between interdependent nodes. We explain this relation by solving the problem analytically for the relevant set of cases.

References in corpus (3)

• Robustness of interdependent networks under targeted attack
• Evolution of robust network topologies: Emergence of central backbones
• Parking on a Random Tree

Cited by in corpus (8)

• Multilayer Networks
• Cascading Failures in Complex Networks
• Cascading failures in interdependent networks with finite functional components
• Interdependent Lattice Networks in High Dimensions
• Percolation phase transition by removal of $k^2$-mers from fully occupied lattices
• The effect of randomness for dependency map on the robustness of interdependent lattices
• Standard and inverse site percolation of straight rigid rods on triangular lattices: Isotropic and nematic deposition/removal
• A study of cascading failures in real and synthetic power grid topologies using DC power flows