Resilience of Complex Networks to Random Breakdown
Gerald Paul, Sameet Sreenivasan, and H.Eugene Stanley
TL;DR
This paper investigates the resilience of complex networks with different degree distributions to random node removal, using simulations to evaluate the critical fraction of nodes that cause network disconnection.
Contribution
It provides a simulation-based analysis of network robustness, challenging existing theoretical predictions and clarifying the conditions under which those predictions hold.
Findings
Simulation results differ from Cohen et al.'s predictions
The validity domain of the theoretical equation is clarified
Resilience varies with degree distribution type
Abstract
Using Monte Carlo simulations we calculate , the fraction of nodes which are randomly removed before global connectivity is lost, for networks with scale-free and bimodal degree distributions. Our results differ with the results predicted by an equation for proposed by Cohen, et al. We discuss the reasons for this disagreement and clarify the domain for which the proposed equation is valid.
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.