Robustness measurement of scale-free networks based on motif entropy

被引：0

作者：

杨云云 ^{[1
]}

冯彪 ^{[1
]}

张辽 ^{[1
]}

薛舒红 ^{[1
]}

谢新林 ^{[2
]}

王建荣 ^{[3
]}

机构：

[1] College of Electrical and Power Engineering Taiyuan University of Technology

[2] Taiyuan University of Science and Technology

[3] School of Mathematical Sciences Shanxi University

来源：

Chinese Physics B | 2022年 / 08期

基金：

中国博士后科学基金; 中国国家自然科学基金;

关键词：

D O I：

暂无

中图分类号：

O157.5 [图论];

学科分类号：

070104 ;

摘要：

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.

引用

页码：21 / 27

页数：7

共 13 条

[1] Robustness Assessment and Enhancement of Power Grids From a Complex Network's Perspective Using Decision Trees
Liu, Dong
Tse, Chi K.
Zhang, Xi
[J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2019, 66 (05) : 833 - 837
[2] Robustness and percolation of holes in complex networks[J] . Andu Zhou,Slobodan Maleti?,Yi Zhao.Physica A: Statistical Mechanics and its Applicat . 2018
[3] Efficient calculation of the robustness measure[formula omitted] for complex networks[J] . Chen Hong,Ning He,Oriol Lordan,Bo-Yuan Liang,Nai-Yu Yin.Physica A: Statistical Mechanics and its Applicat . 2017
[4] Dynamical robustness analysis of weighted complex networks
He, Zhiwei
Liu, Shuai
Zhan, Meng
[J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2013, 392 (18) : 4181 - 4191
[5] Robustness analysis of urban transit network based on complex networks theory
Zou, Zhiyun
Xiao, Yao
Gao, Jianzhi
[J]. KYBERNETES, 2013, 42 (03) : 383 - 399
[6] Effective graph resistance
Ellens, W.
Spieksma, F. M.
Van Mieghem, P.
Jamakovic, A.
Kooij, R. E.
[J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2011, 435 (10) : 2491 - 2506
[7] Bicomponents and the robustness of networks to failure
Newman, M. E. J.
Ghoshal, Gourab
[J]. PHYSICAL REVIEW LETTERS, 2008, 100 (13)
[8] FANMOD: a tool for fast network motif detection[J] . Wernicke Sebastian,Rasche Florian.Bioinformatics （Oxford, England） . 2006 (9)
[9] Intensity and coherence of motifs in weighted complex networks[J] . Onnela JukkaPekka,Saram?ki Jari,Kertész János,Kaski Kimmo.Physical review. E, Statistical, nonlinear, and soft matter physics . 2005 (6 Pt)
[10] Scale-free networks
Barabási, AL
Bonabeau, E
[J]. SCIENTIFIC AMERICAN, 2003, 288 (05) : 60 - 69

← 1 2 →