The robust-yet-fragile nature of interdependent networks

Abstract

Interdependent networks have been shown to be extremely vulnerable based on the percolation model. Parshani et. al further indicated that the more inter-similar networks are, the more robust they are to random failure. Our understanding of how coupling patterns shape and impact the cascading failures of loads in interdependent networks is limited, but is essential for the design and optimization of the real-world interdependent networked systems. This question, however, is largely unexplored. In this paper, we address this question by investigating the robustness of interdependent ER random graphs and BA scale-free networks under both random failure and intentional attack. It is found that interdependent ER random graphs are robust-yet-fragile under both random failures and intentional attack. Interdependent BA scale-free networks, however, are only robust-yet-fragile under random failure but fragile under intentional attack. These results advance our understanding of the robustness of interdependent networks significantly.

arXiv comment5 pages

References in corpus (13)

• Error and attack tolerance of complex networks
• Catastrophic cascade of failures in interdependent networks
• Cascade-based attacks on complex networks
• Interdependent networks: Reducing the coupling strength leads to a change from a first to second order percolation transition
• Robustness of a Network of Networks
• Suppressing cascades of load in interdependent networks
• Inter-similarity between coupled networks
• Network robustness of multiplex networks with interlayer degree correlations
• Spreading gossip in social networks
• Traffic congestion in interconnected complex networks
• Percolation of partially interdependent networks under targeted attack
• The resilience of interdependent transportation networks under targeted attack
• The spread of gossip in American schools