Generalized theory for node disruption in finite size complex networks

Abstract

After a failure or attack the structure of a complex network changes due to node removal. Here, we show that the degree distribution of the distorted network, under any node disturbances, can be easily computed through a simple formula. Based on this expression, we derive a general condition for the stability of non-correlated finite complex networks under any arbitrary attack. We apply this formalism to derive an expression for the percolation threshold $f_c$ under a general attack of the form $f_k\sim k^{\gamma }$, where $f_k$ stands for the probability of a node of degree $k$ of being removed during the attack. We show that $f_c$ of a finite network of size $N$ exhibits an additive correction which scales as $N^{-1}$ with respect to the classical result for infinite networks.

References in corpus (17)

• Error and attack tolerance of complex networks
• Random graphs with arbitrary degree distributions and their applications
• Network robustness and fragility: Percolation on random graphs
• Resilience of the Internet to random breakdowns
• Attack vulnerability of complex networks
• Breakdown of the Internet under intentional attack
• Immunization of complex networks
• Efficient Immunization Strategies for Computer Networks and Populations
• Cascade control and defense in complex networks
• Epidemic dynamics in finite size scale-free networks
• Invasion threshold in heterogeneous metapopulation networks
• Stability and topology of scale-free networks under attack and defense strategies
• Optimization of Network Robustness to Waves of Targeted and Random Attack
• Two-Peak and Three-Peak Optimal Complex Networks
• Information Horizons in Networks
• Optimization of robustness of scale-free network to random and targeted attacks
• Graph Partitioning Induced Phase Transitions

Cited by in corpus (1)

• Correlations in complex networks under attack