计算机与数字工程2024，Vol.52Issue(3)：677-680,687,5.DOI:10.3969/j.issn.1672-9722.2024.03.007
基于介度中心性熵的复杂网络关键节点识别算法
Key Node Identification Algorithm of Complex Network Based on Degree and Betweenness of Medium Centrality
摘要
Abstract
The identification of key nodes in complex networks has always been a hot topic in complex network research.Re-searchers propose a variety of key node identification algorithms based on local or global attributes of the network.The traditional key node identification algorithm only considers the influence of single factor such as degree centrality or betweenness centrality,which has some limitations.Network entropy is an important index to measure the amount of information carried by the network.Ac-cording to the degree centrality and betweenness centrality of the network,this paper defines the betweenness centrality,and com-bines with the network entropy,and proposes a centrality algorithm based on the local and global attributes of the network.The invul-nerability of network is compared with degree centrality,betweenness centrality,local entropy and mapping entropy.Simulation re-sults show that compared with the other four algorithms,the key nodes identified by the entropy algorithm can make the network con-nectivity drop to the collapse threshold faster,and can identify the key nodes more accurately.At the same time,it is verified in real network,and it is found that the performance of mesocentricity entropy algorithm is better in real network.关键词
介度中心性熵/关键节点/度中心性/介数中心性/抗毁性Key words
degree-betweenness of medium centrality/key nodes/degree centrality/betweenness centrality/destructibility分类
信息技术与安全科学引用本文复制引用
王啸,李晗..基于介度中心性熵的复杂网络关键节点识别算法[J].计算机与数字工程,2024,52(3):677-680,687,5.基金项目
辽宁省博士科研启动基金项目(编号:2019-BS-121) （编号:2019-BS-121）
中央引导地方科技发展资金(编号:2020JH6/10500067)资助. （编号:2020JH6/10500067）
