OPTIMIZATION OF ROBUSTNESS OF SCALE-FREE NETWORK TO RANDOM AND TARGETED ATTACKS
JIAN-GUO LIU, ZHONG-TUO WANG, YAN-ZHONG DANG
Modern physics letters B
The scale-fee networks, having connectivity distribution P(k)∼ k^-α (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 per node constant. We find that when =3 the robustness of the scale-free networks reach its maximum value if the
... l connectivity m=1, but when is larger than four, the networks will become more robust to random failures and targeted attacks as the minimal connectivity m gets larger.