arXiv · cond-mat/0507202
Resilience of Complex Networks to Random Breakdown
Abstract
Using Monte Carlo simulations we calculate $f_c$, 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 $f_c$ proposed by Cohen, et al. We discuss the reasons for this disagreement and clarify the domain for which the proposed equation is valid.
Explore related subjects
Keep this discovery
Gerald Paul, Sameet Sreenivasan, H. Eugene Stanley. 2005-07-08. Resilience of Complex Networks to Random Breakdown. https://doi.org/10.1103/physreve.72.056130
Cite the original work for its findings. Save a collection to share your selection of sources.