Cascade of failures in coupled network systems with multiple support-dependent relations
Jia Shao, Sergey V. Buldyrev, Shlomo Havlin, and H. Eugene Stanley

TL;DR
This paper models and analyzes the cascading failures in two coupled networks with support-dependent relations, deriving percolation laws for the surviving giant components after random attacks, and validates the theory with simulations on Erdős-Rényi and scale-free networks.
Contribution
The paper introduces a new analytical framework for cascading failures in coupled networks with multiple support-dependent links, extending previous models to include random support relations.
Findings
Derived explicit percolation laws for coupled networks' giant components.
Showed that increasing support links reduces cascading failures.
Validated theoretical predictions with simulations on ER and scale-free networks.
Abstract
We study, both analytically and numerically, the cascade of failures in two coupled network systems A and B, where multiple support-dependent relations are randomly built between nodes of networks A and B. In our model we assume that each node in one network can function only if it has at least a single support node in the other network. If both networks A and B are Erd\H{o}s-R\'enyi networks, A and B, with (i) sizes and , (ii) average degrees and , and (iii) support links from network A to B and support links from network B to A, we find that under random attack with removal of fractions and nodes respectively, the percolating giant components of both networks at the end of the cascading failures, and , are given by the percolation laws $\mu^A_\infty = R^A…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
