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.

References in corpus (10)

• Error and attack tolerance of complex networks
• Assortative mixing in networks
• Evolution of networks
• Network robustness and fragility: Percolation on random graphs
• Resilience of the Internet to random breakdowns
• Breakdown of the Internet under intentional attack
• Generation of uncorrelated random scale-free networks
• Cut-offs and finite size effects in scale-free networks
• Resilience to damage of graphs with degree correlations
• Uncorrelated Random Networks

Cited by in corpus (7)

• Optimization of Network Robustness to Random Breakdowns
• Percolation theory applied to measures of fragmentation in social networks
• Scale-free networks resistant to intentional attacks
• Enhancing the robustness of a multiplex network leads to multiple discontinuous percolation transitions
• A New Framework for Network Disruption
• The All-Pairs Vitality-Maximization (VIMAX) Problem
• Impact of Random Failures and Attacks on Poisson and Power-Law Random Networks