Importance identification method of complex network nodes based on betweenness and degree entropy

Abstract

Abstract: Existent complex networks will usually be subject to random attacks and deliberate attacks, resulting in reduced reliability of complex network topologies. In order to solve the above-mentione problems, a new attack strategy is proposed based on graph entropy and incorporated with the betweenness centrality of nodes and the degree centrality of all their neighbor nodes, namely the betweenness and degree entropy (BE), which is used to identify important nodes in the network and protect them. Experimentally, the efficiency of attack strategies of three standard network models and three real networks is evaluated under condition of static attacks and dynamic attacks. By means of comparison, it is found that the betweenness and degree entropy will have higher attack efficiency than the traditional attack strategy.

Key words: complex network, centrality, attack strategy, invulnerability, betweenness and degree entropy

CLC Number:

TP393

LU Peng-li, GUO Xu-dong, DONG Men, CAO Le. Importance identification method of complex network nodes based on betweenness and degree entropy[J]. Journal of Lanzhou University of Technology, 2020, 46(2): 111-115.

References

[1] MOTTER A E,ALBERT R.Networks in motion [J].Physics Today,2012,65(4):43-48.
[2] ALBERT R.Diameter of the world wide web [J].Nature,1999,401(6):130-131.
[3] FREEMAN L C.A set of measures of centrality based on betweenness [J].Sociometry,1977,40(1):35-41.
[4] SABIDUSSI G.The centrality index of a graph [J].Psychometrika,1966,31(4):581-603.
[5] NEWMAN M E J.Finding community structure in networks using the eigenvectors of matrices [J].Physical Review E Statistical Nonlinear & Soft Matter Physics,2006,74(3):036104.
[6] NIE T,GUO Z,ZHAO K,et al.Using mapping entropy to identify node centrality in complex networks [J].Physica A Statistical Mechanics & Its Applications,2016,453:290-297.
[7] GIALAMPOUKIDIS I,KALPAKIS G,TSIKRIKA T,et al.Key player identification in terrorism-related social media networks using centrality measures [C]//2016 European Intelligence and Security Informatics Conference (EISIC).[S.l.]:IEEE,2016.
[8] GAO X,LI K,CHEN B.Invulnerability measure of a military heterogeneous network based on network structure entropy [J].IEEE Access,2018,6:6700-6708.
[9] CHEN Jueyu,PENG Minfang,GAO Xiang,et al.Multi-objective distribution network planning considering invulnerability [C]//Technology,Networking,Electronic & Automation Control Conference.[S.l.]:IEEE,2018.
[10] 董政呈,方彦军,田猛.相互依存网络抗毁性研究综述 [J].复杂系统与复杂性科学,2017(3):30-44.
[11] 付秀琴,李腾.不同攻击策略下快递配送网络抗毁性分析 [J].经济师,2017(6):75-78.
[12] 胡鑫,王刚,马润年.基于动态贝叶斯网络的复杂网络抗毁性分析 [J].火力与指挥控制,2017,42(11):5-9.
[13] GAO Xiue,ZHANG Duoping,LI Keqiu,et al.A cascading failure model for command and control networks with hierarchystructure [J].Security and Communication Networks,2018,9:1-14.
[14] DEHMER M,MOWSHOWITZ A.A history of graph entropy measures [J].Inf Sci,2011,181:57-78.
[15] CAO S,DEHMER M,SHI Y.Externality of degree-based graph entropies [J].Inf Sci,2014,278:22-33.
[16] CAO S,DEHMER M.Degree-based entropies of networks revisited [J].Appl Math Comput,2015,261:141-147.
[17] ZHANG J,ZHAO C,WU H,et al.Virtual network embedding based on graph entropy [J].Entropy,2018,20(5):315-326.
[18] GHORBANI M,DEHMER M,ZANG S,et al.Graph operations based on using distance-based graph entropies [J].Applied Mathematics & Computation,2018,333:547-555.
[19] Pajek datasets [DB/OL].(2003-10-11) [2018-09-15].http://vlado.fmf.uni-lj.si/pub/networks/data/.