Attack Robustness of Scale-Free Networks Based on Grey Information

We introduce an attack robustness model of scale-free networks based on grey information, which means that one can obtain the information of all nodes, but the attack information may be imprecise. The known random failure and the intentional attack are two extreme cases of our investigation. Using the generating function method, we derive the analytical value of the critical removal fraction of nodes for the disintegration of networks, which agree with the simulation results well. We also investigate the effect of grey information on the attack robustness of scale-free networks and find that decreasing the precision of attack information can remarkably enhance the attack robustness of scale-free networks.

[1]  L. Dall’Asta.  Inhomogeneous percolation models for spreading phenomena in random graphs , 2005, cond-mat/0509020.

[2]  Beom Jun Kim,et al.  Attack vulnerability of complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Rong Li-li,et al.  Effect Attack on Scale-Free Networks due to Cascading Failures , 2008 .

[4]  Hongzhong Deng,et al.  Vulnerability of complex networks under intentional attack with incomplete information , 2007 .

[5]  Jian-Guo Liu,et al.  Optimization of Scale-Free Network for Random Failures , 2006 .

[6]  Béla Bollobás,et al.  Robustness and Vulnerability of Scale-Free Random Graphs , 2004, Internet Math..

[7]  Reuven Cohen,et al.  Tolerance of scale-free networks: from friendly to intentional attack strategies , 2004 .

[8]  Wen-Xu Wang,et al.  Cascade of elimination and emergence of pure cooperation in coevolutionary games on networks. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Cai Xu,et al.  Stability of Random Networks under Evolution of Attack and Repair , 2006 .

[10]  Reuven Cohen,et al.  Stability and topology of scale-free networks under attack and defense strategies. , 2005, Physical review letters.

[11]  D S Callaway,et al.  Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.

[12]  S. Havlin,et al.  Breakdown of the internet under intentional attack. , 2000, Physical review letters.

[13]  Béla Bollobás,et al.  Random Graphs , 1985 .

[14]  Ouyang Qi,et al.  Distance Distribution and Reliability of Small-World Networks , 2001 .

[15]  Xiao Fan Wang,et al.  Complex Networks: Topology, Dynamics and Synchronization , 2002, Int. J. Bifurc. Chaos.

[16]  Li Fang,et al.  Robustness of Complex Networks under Attack and Repair , 2009 .

[17]  Tan Yue-jin,et al.  A Robustness Model of Complex Networks with Tunable Attack Information Parameter , 2007 .

[18]  Yuejin Tan,et al.  Relationship between degree–rank distributions and degree distributions of complex networks , 2007 .

[19]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[21]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[22]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[23]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

[24]  Ziyou Gao,et al.  Cascade defense via navigation in scale free networks , 2007 .

[25]  Cohen,et al.  Resilience of the internet to random breakdowns , 2000, Physical review letters.