Percolation of a general network of networks
Jianxi Gao, Sergey V. Buldyrev, H. Eugene Stanley, Xiaoming Xu, and, Shlomo Havlin

TL;DR
This paper develops an analytical framework to study the percolation properties of interdependent networks, revealing how cascading failures can cause abrupt system collapses and identifying conditions for different phase transitions.
Contribution
It introduces a general analytical framework for interdependent networks, analyzing percolation transitions and the effects of network topology and feedback on system robustness.
Findings
Interdependent networks can exhibit discontinuous percolation transitions due to cascading failures.
Loops in the network topology influence the size of the largest connected component.
Feedback coupling can lead to only second-order transitions or abrupt collapses.
Abstract
Percolation theory is an approach to study vulnerability of a system. We develop analytical framework and analyze percolation properties of a network composed of interdependent networks (NetONet). Typically, percolation of a single network shows that the damage in the network due to a failure is a continuous function of the fraction of failed nodes. In sharp contrast, in NetONet, due to the cascading failures, the percolation transition may be discontinuous and even a single node failure may lead to abrupt collapse of the system. We demonstrate our general framework for a NetONet composed of classic Erd\H{o}s-R\'{e}nyi (ER) networks, where each network depends on the same number of other networks, i.e., a random regular network of interdependent ER networks. In contrast to a \emph{treelike} NetONet in which the size of the largest connected cluster (mutual component) depends on…
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.
