How to make a fragile network robust and vice versa

Abstract

We investigate topologically biased failure in scale-free networks with degree distribution $P(k)\propto k^{-\gamma }$. The probability $p$ that an edge remains intact is assumed to depend on the degree $k$ of adjacent nodes $i$ and $j$ through $p_{ij}\propto (k_i{k}_j{)}^{-\alpha }$. By varying the exponent $\alpha$, we interpolate between random ($\alpha =0$) and systematic failure. For $\alpha >0$ ($<0$) the most (least) connected nodes are depreciated first. This topological bias introduces a characteristic scale in $P(k)$ of the depreciated network, marking a crossover between two distinct power laws. The critical percolation threshold, at which global connectivity is lost, depends both on $\gamma$ and on $\alpha$. As a consequence, network robustness or fragility can be controlled through fine tuning of the topological bias in the failure process.

Accepted for publication at Phys. Rev. Lett

References in corpus (13)

• 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
• The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles
• Breakdown of the Internet under intentional attack
• Software systems as complex networks: structure, function, and evolvability of software collaboration graphs
• Percolation Critical Exponents in Scale-Free Networks
• Stability and topology of scale-free networks under attack and defense strategies
• Critical phenomena in networks
• Optimal Paths in Complex Networks with Correlated Weights: The World-wide Airport Network
• Trading interactions for topology in scale-free networks
• Criticality on networks with topology-dependent interactions

Cited by in corpus (35)

• Spatial Networks
• Mitigation of Malicious Attacks on Networks
• Robustness of interdependent networks under targeted attack
• Cascade of failures in coupled network systems with multiple support-dependent relations
• Percolation in real interdependent networks
• Enhancing network robustness for malicious attacks
• Resilience and rewiring of the passenger airline networks in the United States
• Smart Rewiring for Network Robustness
• Bridgeness: A Local Index on Edge Significance in Maintaining Global Connectivity
• Weighted Fractal Networks
• A Hamiltonian approach for explosive percolation
• Biased Percolation on Scale-free Networks
• Simple and efficient self-healing strategy for damaged complex networks
• Cavity analysis on the robustness of random networks against targeted attacks: Influences of degree-degree correlations
• Spectral analysis and slow spreading dynamics on complex networks
• Shock waves on complex networks
• Sequential Defense Against Random and Intentional Attacks in Complex Networks
• Criterion for explosive percolation transitions on complex networks
• Collaboration networks from a large CV database: dynamics, topology and bonus impact
• Correlations in complex networks under attack
• Percolation on bipartite scale-free networks
• Effect of degree correlations above the first shell on the percolation transition
• Universality class of the percolation in two-dimensional lattices with distortion
• Enhanced robustness of evolving open systems by the bidirectionality of interactions between elements
• Time evolution of the behaviour of Brazilian legislative Representatives using a complex network approach
• Response to targeted perturbations for random walks on networks
• Degree heterogeneity in spatial networks with total cost constraint
• Degree-dependent network growth: From preferential attachment to explosive percolation
• Quantitative modeling of degree-degree correlation in complex networks
• Analytic Solution to Clustering Coefficients on Weighted Networks
• On the monotonicity of the critical time in the Constrained-degree percolation model
• Optimal box-covering algorithm for fractal dimension of complex networks
• Node Removal Vulnerability of the Largest Component of a Network
• A look at the way we look at Complex Networks Robustness and Resilience
• Mandala Networks: ultra-robust, ultra-small-world and highly sparse graphs