Attack Robustness of Scale-Free Networks Based on Grey Information
LI Jun1, WU Jun1**, LI Yong2, DENG Hong-Zhong1, TAN Yue-Jin1**
1College of Information Systems and Management, National University of Defense Technology, Changsha 410073 2Department of Business Administration, Changsha University, Changsha 410073
Attack Robustness of Scale-Free Networks Based on Grey Information
LI Jun1, WU Jun1**, LI Yong2, DENG Hong-Zhong1, TAN Yue-Jin1**
1College of Information Systems and Management, National University of Defense Technology, Changsha 410073 2Department of Business Administration, Changsha University, Changsha 410073
摘要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.
Abstract：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.
LI Jun;WU Jun**;LI Yong;DENG Hong-Zhong;TAN Yue-Jin**
. Attack Robustness of Scale-Free Networks Based on Grey Information[J]. 中国物理快报, 2011, 28(5): 58904-058904.
LI Jun, WU Jun**, LI Yong, DENG Hong-Zhong, TAN Yue-Jin**
. Attack Robustness of Scale-Free Networks Based on Grey Information. Chin. Phys. Lett., 2011, 28(5): 58904-058904.
[1] Albert R, Jeong H and Barabási A L 2000 Nature 406 378
[2] Holme P, Kim B J, Yoon C N and Han S K 2002 Phys. Rev. E 65 056109
[3] Bollobás B and Riordan O 2003 Internet Math. 1 1
[4] Chi L P, Yang C B and Cai X 2006 Chin. Phys. Lett. 23 263
[5] Sun K and Ouyang Q 2001 Chin. Phys. Lett. 18 452
[6] Wang J W and Rong L L 2008 Chin. Phys. Lett. 25 3826
[7] Hu B, Li F and Zhou H S 2009 Chin. Phys. Lett. 26 128901
[8] Liu J G, Wang Z T and Dang Y Z 2006 Mod. Phys. Lett. B 20 815
[9] Zhao H and Gao Z Y 2007 Eur. Phys. J. B 57 95
[10] Wang W X, Yang R and Lai Y C 2010 Phys. Rev. E 81 035102
[11] Albert R and Barabási A L 2002 Rev. Mod. Phys. 74 47
[12] Newman M E J 2003 SIAM Rev. 45 167
[13] Wang X F 2002 Int. J. Bifurcation Chaos 12 885
[14] Bollobás B 1985 Random Graphs (New York: Academic)
[15] Wu J, Deng H Z, Tan Y J and Zhu D Z 2007 J. Phys. A 40 2665
[16] Wu J, Deng H Z, Tan Y J and Li Y 2007 Chin. Phys. Lett. 24 2138
[17] Gallos L K, Argyrakis P, Bunde A, Cohen R and Havlin S 2004 Physica A 344 504
[18] Gallos L K, Cohen R, Argyrakis P, Bunde A and Havlin S 2005 Phys. Rev. Lett. 94 188701
[19] Dall'Asta L 2005 J. Stat. Mech. P08011
[20] Wu J, Tan Y, Deng H, Zhu D and Chi Y 2007 Physica A 383 745
[21] Newman M E J, Strogatz S H and Watts D J 2001 Phys. Rev. E 64 26118
[22] Callaway D S, Newman M E J, Strogatz S H and Watts D J 2000 Phys. Rev. Lett. 85 5468
[23] Cohen R, Erez K, ben-Avraham D and Havlin S 2000 Phys. Rev. Lett. 85 4626
[24] Cohen R, Erez K, ben-Avraham D and Havlin S 2001 Phys. Rev. Lett. 86 3682
[25] Molloy M and Reed B 1995 Random Struct. Algor. 6 161
2011, Vol. 28 
