摘要To study the robustness of complex networks under attack and repair, we introduce a repair model of complex networks. Based on the model, we introduce two new quantities, i.e. attack fraction fa and the maximum degree of the nodes that have never been attacked ~Ka, to study analytically the critical attack fraction and the relative size of the giant component of complex networks under attack and repair, using the method of generating function. We show analytically and numerically that the repair strategy significantly enhances the robustness of the scale-free network and the effect of robustness improvement is better for the scale-free networks with a smaller degree exponent. We discuss the application of our theory in relation to the understanding of robustness of complex networks with reparability.
Abstract:To study the robustness of complex networks under attack and repair, we introduce a repair model of complex networks. Based on the model, we introduce two new quantities, i.e. attack fraction fa and the maximum degree of the nodes that have never been attacked ~Ka, to study analytically the critical attack fraction and the relative size of the giant component of complex networks under attack and repair, using the method of generating function. We show analytically and numerically that the repair strategy significantly enhances the robustness of the scale-free network and the effect of robustness improvement is better for the scale-free networks with a smaller degree exponent. We discuss the application of our theory in relation to the understanding of robustness of complex networks with reparability.
HU Bin;LI Fang;ZHOU Hou-Shun. Robustness of Complex Networks under Attack and Repair[J]. 中国物理快报, 2009, 26(12): 128901-128901.
HU Bin, LI Fang, ZHOU Hou-Shun. Robustness of Complex Networks under Attack and Repair. Chin. Phys. Lett., 2009, 26(12): 128901-128901.
[1] Doyle J C, Alderson D L, Li L, Low S, Roughan M, ShalunovS, Tanaka R and Willinger W 2005 Proceedings of the NationalAcademy of Sciences of the United States of America 102 14497 [2] Bassett D S and Bullmore E 2006 Neuroscientist 12 512 [3] Guimera R and Amaral L A N 2005 Nature 433 895 [4] Amaral L A N, Scala A, Barthelemy M and Stanley H E 2000 Proceedings of the National Academy of Sciences of the UnitedStates of America 97 11149 [5] Albert R and Barabasi A L 2002 Rev. Mod. Phys. 74 47 [6] Newman M E J 2003 SIAM Rev. 45 167 [7] Stefono B 2006 Phys. Rep. 424 175 [8] Albert R, Jeong H and Barabasi A L 2000 Nature 406 378 [9] Holme P, Kim B J, Yoon C N and Han S K 2002 Phys.Rev. E 65 056109. [10] Callaway D S, Newman M E J, Strogatez S H and Watts D J2000 Phys. Rev. Lett. 85 5468 [11] Wu J, Deng H, Tan Y and Zhu D 2007 J. Phys. A 40 2665 [12] Shargel B, Sayama H, Epstein I R and Bar-Yam Y 2003 Phys. Rev. Lett. 90 068701 [13] Paul G, Tanizawa T, Havlin S and Stanley H E 2004 Eur. Phys. J. B 38 187 [14] Wang B, Tang H W, Guo C H and Xiu Z L 2006 PhysicaA 363 591 [15] Chi L P, Yang C B and Cai X 2006 Chin. Phys. Lett. 23 263 [16] Newman M E J, Strogatz S H and Watts D J 2001 Phys.Rev. E 64 026118. [17] Cohen R, Erez K, ben-Avraham D and Havlin S 2001 Phys. Rev. Lett. 86 3682 [18] Molloy M and Reed B A 1995 Random Structures andAlgorithms 6 161