Resilience of Complex Networks to Random Breakdown
Abstract
Using Monte Carlo simulations we calculate fc, 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 fc proposed by Cohen, et al. We discuss the reasons for this disagreement and clarify the domain for which the proposed equation is valid.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.