|
|
|
Robustness measurement of scale-free networks based on motif entropy |
| Yun-Yun Yang(杨云云)1,†, Biao Feng(冯彪)1, Liao Zhang(张辽)1, Shu-Hong Xue(薛舒红)1, Xin-Lin Xie(谢新林)2, and Jian-Rong Wang(王建荣)3 |
1 College of Electrical and Power Engineering, Taiyuan University of Technology, Taiyuan 030024, China;
2 Taiyuan University of Science and Technology, Taiyuan 030024, China;
3 School of Mathematical Sciences, Shanxi University, Taiyuan 030024, China |
|
|
|
|
Abstract As a classical complex network model, scale-free network is widely used and studied. And motifs, as a high-order subgraph structure, frequently appear in scale-free networks, and have a great influence on the structural integrity, functional integrity and dynamics of the networks. In order to overcome the shortcomings in the existing work on the robustness of complex networks, only nodes or edges are considered, while the defects of high-order structure in the network are ignored. From the perspective of network motif, we propose an entropy of node degree distribution based on motif to measure the robustness of scale-free networks under random attacks. The effectiveness and superiority of our method are verified and analyzed in the BA scale-free networks.
|
Received: 27 February 2022
Revised: 18 April 2022
Accepted manuscript online: 22 April 2022
|
|
PACS:
|
02.30.-f
|
(Function theory, analysis)
|
| |
02.30.Yy
|
(Control theory)
|
| |
05.10.-a
|
(Computational methods in statistical physics and nonlinear dynamics)
|
| |
05.65.+b
|
(Self-organized systems)
|
|
| Fund: Project supported by the National Natural Science Foundation of China (Grant No. 62006169), the Youth Natural Science Foundation of Shanxi Province, China (Grant No. 201901D211304), the China Postdoctoral Science Foundation (Grant No. 2021M692400), and the Science and Technology Innovation Projects of Universities in Shanxi Province, China (Grant No. 2020L0021). |
Corresponding Authors:
Yun-Yun Yang
E-mail: yangyunyun@tyut.edu.cn
|
Cite this article:
Yun-Yun Yang(杨云云), Biao Feng(冯彪), Liao Zhang(张辽), Shu-Hong Xue(薛舒红), Xin-Lin Xie(谢新林), and Jian-Rong Wang(王建荣) Robustness measurement of scale-free networks based on motif entropy 2022 Chin. Phys. B 31 080201
|
[1] Boccaletti S, Latora V, Moreno Y, Chavez M and Hwang D U 2006 Phys. Rep.-Rev. Sec. Phys. Lett. 424 175
[2] Albert R, Jeong H and Barabási A L 2000 Nature 406 378
[3] Newman M and Ghoshal G 2008 Phys. Rev. Lett. 100 138701
[4] Clemente G P and Cornaro A 2020 Soft Comput. 24 13687
[5] Wang X R, Pournaras E, Kooij R E and Van Mieghem P 2014 Eur. Phys. J. B 87 221
[6] Ellens W, Spieksma F M, Van Mieghem P, Jamakovic A and Kooij R E 2011 Linear Alg. Appl. 435 2491
[7] He Z W, Liu S and Zhan M 2013 Physica A 392 4181
[8] Kasthurirathna D, Piraveenan M and Thedchanamoorthy G 2013 IEEE Conference on Evolving and Adaptive Intelligent Systems (EAIS), April 16-19, 2013, Singapore, Singapore, p. 122
[9] Zhou A, Maletic S and Zhao Y 2018 Physica A 502 459
[10] Liu D, Tse C K and Zhang X 2019 IEEE Trans. Circuits Syst. II-Express Briefs 66 833
[11] Zhang X and Ise C K 2015 IEEE International Symposium on Circuits and Systems (ISCAS), May 24-27, 2015, Lisbon, Portugal, p. 2684
[12] Yang H H and An S 2021 Alex. Eng. J. 60 2065
[13] Manzano M, Calle E, Torres-Padrosa V, Segovia J and Harle D 2014 Comput. Netw. 57 3641
[14] Zou Z Y, Xiao Y and Gao J Z 2013 Kybernetes 42 383
[15] Yang Y H, Liu, Y X, Zhou M X, Li F X and Sun C 2015 Saf. Sci. 79 149
[16] Zhou X, Zhang F M, Zhou W P, Zou W and Yang F 2012 Acta Phys. Sin. 61 190201 (in Chinese)
[17] Hong C, He N, Lordan O, Liang B Y and Yin N Y 2017 Physica A 478 63
[18] Wu Y P, Chen Z L, Yao K, Zhao X D and Chen Y C 2019 Fractals-Complex Geom. Patterns Scaling Nat. Soc. 27
[19] Wu J, Barahona M, Tan Y J and Deng H Z 2006 IEEE Trans. Syst. Man Cybern. Paart A-Syst. Hum. 41 1244
[20] Milo R, Shen-Orr S, Itzkovitz S, Kashtan N, Chklovskii D and Alon U 2002 Science 298 824
[21] Onnela J P, Saramaki J, Kertesz J and Kaski K 2005 Phys. Rev. E 71 065103
[22] Barabási A L and Bonabeau E 2003 Sci. Am. 288 60
[23] Barabási A L and Albert R 1999 Science 286 509
[24] Wernicke S and Rasche F 2006 Bioinformatics 22 1152
[25] Wernicke S 2006 5th International Workshop on Algorithms in Bioinformatics (WABI 2005), October 3-6, 2005, Mallorca, Spain, p. 347
[26] Han H, Liu W L and Wu L Y 2013 Acta Phys. Sin. 62 168904 (in Chinese)
[27] Borgatti S P 2003 International Conference on Integration of Knowledge Intenzive Multi-Agent Systems, September 30-October 4, 2003, Cambridge, Ma, p. 127 |
| 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
|
|
|
