Optimization of Network Robustness to Waves of Targeted and Random Attack

Abstract

We study the robustness of complex networks to multiple waves of simultaneous (i) targeted attacks in which the highest degree nodes are removed and (ii) random attacks (or failures) in which fractions $p_t$ and $p_r$ respectively of the nodes are removed until the network collapses. We find that the network design which optimizes network robustness has a bimodal degree distribution, with a fraction $r$ of the nodes having degree $k_2= (\kav - 1 +r)/r$ and the remainder of the nodes having degree $k_1=1$, where $\kav$ is the average degree of all the nodes. We find that the optimal value of $r$ is of the order of $p_t/p_r$ for $p_t/p_r\ll 1$.

References in corpus (2)

• Optimization of Robustness of Complex Networks
• Two-Peak and Three-Peak Optimal Complex Networks

Cited by in corpus (39)

• Network robustness of multiplex networks with interlayer degree correlations
• Generalized Network Dismantling
• Entropy Optimization of Scale-Free Networks Robustness to Random Failures
• Robustness of onion-like correlated networks against targeted attacks
• Error and Attack Tolerance of Layered Complex Networks
• Evolution of robust network topologies: Emergence of central backbones
• Accounting for the Complex Hierarchical Topology of EEG Phase-Based Functional Connectivity in Network Binarisation
• Modular networks emerge from multiconstraint optimization
• Optimization of Network Robustness to Random Breakdowns
• Optimization of network structure to random failures
• Percolation theory applied to measures of fragmentation in social networks
• Limited path percolation in complex networks
• Cavity analysis on the robustness of random networks against targeted attacks: Influences of degree-degree correlations
• Underestimated cost of targeted attacks on complex networks
• Enhancing the robustness of scale-free networks
• Optimal control of aging in complex networks
• Building Damage-Resilient Dominating Sets in Complex Networks against Random and Targeted Attacks
• Neighborhood Information-based Probabilistic Algorithm for Network Disintegration
• Resilience of spatial networks with inter-links behaving as an external field
• Goal-directed graph construction using reinforcement learning
• A Survey of Link Recommendation for Social Networks: Methods, Theoretical Foundations, and Future Research Directions
• Generalized theory for node disruption in finite size complex networks
• Revealing directed effective connectivity of cortical neuronal networks from measurements
• Topological changes at the jamming and gel transition of a reversible polymeric network
• Characterizing the Robustness of Complex Networks
• Enhancing the robustness of a multiplex network leads to multiple discontinuous percolation transitions
• Robustness analysis of bimodal networks in the whole range of degree correlation
• On extreme points of the diffusion polytope
• Maximal switchability of centralized networks
• Design of endurable networks in the presence of aging
• Optimized two-dimensional Networks with edge crossing cost: frustrated anti-ferromagnetic spin system
• Network structure and dynamics of effective models of non-equilibrium quantum transport
• Protein Interaction Networks are Fragile against Random Attacks and Robust against Malicious Attacks
• Structure Entropy and Resistor Graphs
• Analysis of Graphs for Digital Preservation Suitability
• Increased Network Interdependency Leads to Aging
• Impact of Random Failures and Attacks on Poisson and Power-Law Random Networks
• The emergence of critical stocks in market crash
• Mandala Networks: ultra-robust, ultra-small-world and highly sparse graphs