Robustness measurement of scale-free networks based on motif entropy  

作　　者：Yun-Yun Yang Biao Feng Liao Zhang Shu-Hong Xue Xin-Lin Xie Jian-Rong Wang 杨云云;冯彪;张辽;薛舒红;谢新林;王建荣(College of Electrical and Power Engineering,Taiyuan University of Technology,Taiyuan 030024,China;Taiyuan University of Science and Technology,Taiyuan 030024,China;School of Mathematical Sciences,Shanxi University,Taiyuan 030024,China)

机构地区：[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

出　　处：《Chinese Physics B》2022年第8期190-196,共7页中国物理B（英文版）

基　　金：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);the Science and Technology Innovation Projects of Universities in Shanxi Province, China (Grant No. 2020L0021)。

摘　　要：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.

关 键 词：MOTIF network robustness SCALE-FREE ENTROPY 

分 类 号：O157.5[理学—数学]