Percolation in networks composed of connectivity and dependency links
Amir Bashan, Roni Parshani, Shlomo Havlin

TL;DR
This paper analyzes how the presence and distribution of dependency links in networks affect their robustness and percolation transitions, revealing that dependency structures can cause more abrupt, first-order failures.
Contribution
It provides an analytical framework for understanding the impact of different dependency link distributions on network robustness, extending classical percolation theory.
Findings
Networks with dependency links are more vulnerable than classical networks.
Dependency structures can induce first-order percolation transitions.
Analytical expressions for giant component size in networks with various dependency distributions.
Abstract
Networks composed from both connectivity and dependency links were found to be more vulnerable compared to classical networks with only connectivity links. Their percolation transition is usually of a first order compared to the second order transition found in classical networks. We analytically analyze the effect of different distributions of dependencies links on the robustness of networks. For a random Erds-Rnyi (ER) network with average degree that is divided into dependency clusters of size , the fraction of nodes that belong to the giant component, , is given by where is the initial fraction of removed nodes. Our general result coincides with the known Erds-Rnyi equation for random networks for and with the result of Parshani et al (PNAS, in press, 2011) for…
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.
