Optimization of robustness of scale-free network to random and targeted attacks

Abstract

The scale-fee networks, having connectivity distribution $P(k)\sim k^{-\alpha }$ (where $k$ is the site connectivity), is very resilient to random failures but fragile to intentional attack. The purpose of this paper is to find the network design guideline which can make the robustness of the network to both random failures and intentional attack maximum while keeping the average connectivity $<k>$ per node constant. We find that when $<k>=3$ the robustness of the scale-free networks reach its maximum value if the minimal connectivity $m=1$, but when $<k>$ is larger than four, the networks will become more robust to random failures and targeted attacks as the minimal connectivity $m$ gets larger.

References in corpus (8)

• Statistical mechanics of complex networks
• The structure and function of complex networks
• The structure of scientific collaboration networks
• Random graphs with arbitrary degree distributions and their applications
• Resilience of the Internet to random breakdowns
• Breakdown of the Internet under intentional attack
• Optimization of Robustness of Complex Networks
• Two-Peak and Three-Peak Optimal Complex Networks

Cited by in corpus (8)

• A limited resource model of fault-tolerant capability against cascading failure of complex network
• Weighted Network of Chinese Nature Science Basic Research
• Optimization of network structure to random failures
• Growing Scale-free Small-world Networks with Tunable Assortative Coefficient
• Complex Network Properties of Chinese Natural Science Basic Research
• Multistage Random Growing Small-World Networks with Power-law degree Distribution
• Generalized theory for node disruption in finite size complex networks
• Robustness of Random Networks with Selective Reinforcement against Attacks