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 (2)

• Optimal Paths in Complex Networks with Correlated Weights: The World-wide Airport Network
• Criticality on networks with topology-dependent interactions

Cited by in corpus (11)

• Mitigation of Malicious Attacks on Networks
• Robustness of interdependent networks under targeted attack
• Percolation in real interdependent networks
• Enhancing network robustness for malicious attacks
• Cavity analysis on the robustness of random networks against targeted attacks: Influences of degree-degree correlations
• Sequential Defense Against Random and Intentional Attacks in Complex Networks
• Criterion for explosive percolation transitions on complex networks
• Correlations in complex networks under attack
• Response to targeted perturbations for random walks on networks
• Node Removal Vulnerability of the Largest Component of a Network
• Mandala Networks: ultra-robust, ultra-small-world and highly sparse graphs