INTERDISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY |
Prev
Next
|
|
|
The robustness of sparse network under limited attack capacity |
Xiao-Juan Wang(王小娟)1, Mei Song(宋梅)1, Lei Jin(金磊)1, Zhen Wang(王珍)2 |
1 Electronic Engineering Institute, Beijing University of Posts and Telecommunications, Beijing 100876, China;
2 Electronic Engineering Institute of PLA, Hefei 230000, China |
|
|
Abstract The paper studies the robustness of the network in terms of the network structure. We define a strongly dominated relation between nodes and then we use the relation to merge the network. Based on that, we design a dominated clustering algorithm aiming at finding the critical nodes in the network. Furthermore, this merging process is lossless which means the original structure of the network is kept. In order to realize the visulization of the network, we also apply the lossy consolidation to the network based on detection of the community structures. Simulation results show that compared with six existed centrality algorithms, our algorithm performs better when the attack capacity is limited. The simulations also illustrate our algorithm does better in assortative scale-free networks.
|
Received: 13 January 2017
Revised: 21 April 2017
Accepted manuscript online:
|
PACS:
|
89.75.Ck
|
|
|
89.75.Fb
|
(Structures and organization in complex systems)
|
|
Fund: Project supported by the National Natural Science Foundation of China (Grant No. 61471055). |
Corresponding Authors:
Mei Song
E-mail: songmbupt@126.com
|
About author: 0.1088/1674-1056/26/8/ |
Cite this article:
Xiao-Juan Wang(王小娟), Mei Song(宋梅), Lei Jin(金磊), Zhen Wang(王珍) The robustness of sparse network under limited attack capacity 2017 Chin. Phys. B 26 088901
|
[1] |
Cai Q and Liu J 2016 Sci. Rep. 6 35904
|
[2] |
Baldassano S N and Bassett D S 2016 Sci. Rep. 6 26087
|
[3] |
Zhang Y, Zhou S, Guan J, et al. 2011 Phys. Rev. E 87 1079
|
[4] |
A.L Barabasi, H Jeong, Z Nda, et al. 2015 Veterinary Surgery 6 66
|
[5] |
Gao J, Liu Y Y, D'Souza R M, et al. 2014 Nat. Commu. 5 5415
|
[6] |
Ito S and Sagawa T 2013 Phys. Rev. Lett. 111 81
|
[7] |
Mitrović M and Tadić B 2009 Phys. Rev. E 80 026123
|
[8] |
Karrer B, Newman M E and Zdeborová L 2014 Phys. Rev. Lett. 113 208702
|
[9] |
Decelle A, Krzakala F, Moore C, et al. 2011 Phys. Rev. Lett. 107 065701
|
[10] |
Luccioli S, Olmi S, Politi A, et al. 2012 Phys. Rev. Lett. 109 138103
|
[11] |
Kitsak M, Gallos L K, Havlin S, et al. 2010 Nat. Phys. 6 888
|
[12] |
Dorogovtsev S N, Goltsev A V and Mendes J F 2006 Phys. Rev. Lett. 96 185
|
[13] |
Elbirt B 2007 "The nature of networks: A structural census of degree centrality across multiple network sizes and edge densities", Ph. D. Dissertation (Buffalo: State University of New York)
|
[14] |
Freeman L C 1977 Sociometry 40 35
|
[15] |
Freeman L C 1978 Social Networks 1 215
|
[16] |
Batagelj V and Zaversnik M 2003 Comput. Sci. 1 34
|
[17] |
Latora V and Marchiori M 2005 Phys. Rev. E 71 015103
|
[18] |
Karrer B, Newman M E and Zdeborov L 2014 Phys. Rev. Lett. 113 208702
|
[19] |
Agliari E, Cioli C and Guadagnini E 2011 Phys. Rev. E 84 247
|
[20] |
Azimitafreshi N, Gmezgardes J and Dorogovtsev S N 2014 Phys. Rev. E 90 032816
|
[21] |
Liu J G, Lin J H, Guo Q, et al. 2015 Sci. Rep. 6 032812
|
[22] |
Tian L and Shi D N 2012 Phys. Lett. A 376 286
|
[23] |
Kanevsky A 1993 Networks 23 533
|
[24] |
Rosvall M and Bergstrom C T 2007 Proceedings of the National Academy of Sciences USA 1118
|
[25] |
Wang F, Li T, Wang X, et al. 2011 Data Mining and Knowledge Discovery 22 493
|
[26] |
Singh A and Humphries M D 2015 Sci. Rep. 5 8828
|
[27] |
Liu W, Pellegrini M and Wang X 2014 Sci. Rep. 4 5739
|
[28] |
Brandes U 2008 Social Networks 30 136
|
[29] |
Bonacich P 1987 American Journal of Sociology 92 1170
|
[30] |
Langville A N and Meyer C D 2005 Siam Review 47 135
|
[31] |
Bu D, Zhao Y, Cai L, et al. 2003 Nucleic Acids Research 31 2443
|
[32] |
http://vlado.fmf.uni-lj.si/pub/networks/data/http://vlado.fmf.uni-lj.si/pub/networks/data/
|
[33] |
Watts D J and Strogatz S H 1998 Nature 393 440
|
[34] |
Adamic L, Glance N, Adamic L, et al. 2005 IL Nuovo Cimento A 62 127
|
[35] |
Roget P M and Dutch R A 1982 Roget's Thesaurus of English Words and Phrases (Longman) p. 90
|
[36] |
Knuth D E 1993 The Stanford Graph Base: a platform for combinatorial computing (Reading: Addison-Wesley) pp. 41-43
|
[37] |
Newman M E 2002 Phys. Rev. Lett. 89 111
|
[38] |
Holme P, Kim B J, Yoon C N and Han S K 2002 Phys. Rev. E 65 56109
|
[39] |
Kempe D, Kleinberg J and Tardos E 2003 Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , August 24-27, 2003, Washington, DC, USA, pp. 137-146
|
No Suggested Reading articles found! |
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
Altmetric
|
blogs
Facebook pages
Wikipedia page
Google+ users
|
Online attention
Altmetric calculates a score based on the online attention an article receives. Each coloured thread in the circle represents a different type of online attention. The number in the centre is the Altmetric score. Social media and mainstream news media are the main sources that calculate the score. Reference managers such as Mendeley are also tracked but do not contribute to the score. Older articles often score higher because they have had more time to get noticed. To account for this, Altmetric has included the context data for other articles of a similar age.
View more on Altmetrics
|
|
|