Robustness of Random Networks with Selective Reinforcement against Attacks

Abstract

We investigate the robustness of random networks reinforced by adding hidden edges against targeted attacks. This study focuses on two types of reinforcement: uniform reinforcement, where edges are randomly added to all nodes, and selective reinforcement, where edges are randomly added only to the minimum degree nodes of the given network. We use generating functions to derive the giant component size and the critical threshold for the targeted attacks on reinforced networks. Applying our analysis and Monte Carlo simulations to the targeted attacks on scale-free networks, it becomes clear that selective reinforcement significantly improves the robustness of networks against the targeted attacks.

arXiv comment16 pages, 6 figures

References in corpus (16)

• Statistical mechanics of complex networks
• The structure and function of complex networks
• Error and attack tolerance of complex networks
• The diameter of the world wide web
• Mixing patterns in networks
• Network robustness and fragility: Percolation on random graphs
• Resilience of the Internet to random breakdowns
• Breakdown of the Internet under intentional attack
• Mitigation of Malicious Attacks on Networks
• Efficient Monte Carlo algorithm and high-precision results for percolation
• Robustness of onion-like correlated networks against targeted attacks
• Structural Robustness of Complex Networks: A Survey of A Posteriori Measures
• Optimization of robustness of scale-free network to random and targeted attacks
• A loop enhancement strategy for network robustness
• Cavity analysis on the robustness of random networks against targeted attacks: Influences of degree-degree correlations
• Robustness analysis of bimodal networks in the whole range of degree correlation