2005/06/27 by Jian-Guo Liu, JIAN-GUO LIU, Zhong-Tuo Wang +3
Computer Science · Physics and Astronomy · #Complex Network Analysis Techniques #Interconnection Networks and Systems #Opportunistic and Delay-Tolerant Networks #cond-mat.other #cond-mat.stat-mech
paper · pdf · doi:10.1142/s0217984905008773
arxiv created 2005/06/27 · openalex publication_date 2005/07/20 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
Scale-free networks, having connectivity distribution P(k)~k -α (where k is the site connectivity), are very resilient to random failures but are fragile to intentional attacks. 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 attacks 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.