现代信息科技2025，Vol.9Issue(1)：40-44,5.DOI:10.19850/j.cnki.2096-4706.2025.01.009
考虑二阶邻居信息的K-shell重要节点识别算法研究
Research on the K-shell Important Node Identification Algorithm Considering Second-order Neighbor Information
摘要
Abstract
In real networks,identifying some key nodes for protection can effectively maintain the stability of the system.Meanwhile,it also plays important roles in virus control and propagation in complex networks,fault control in transportation networks and influence identification in social networks.Based on the existing key node identification algorithm of K-shell,a key node identification algorithm of K-shell considering the second-order neighbor information is proposed.This algorithm comprehensively considers the global and local information of nodes,and simultaneously introduces the relevant information of first-order neighbor nodes and second-order neighbor nodes of nodes to calculate the importance of nodes in the networks.In order to verify the performance of this algorithm,simulation experiments are carried out on nodes in the networks of the two kinds of attacks of random attacks and deliberate attacks.The experimental results show that the K-shell method considering second-order neighbor information can effectively detect the importance of nodes and identify the key nodes in the networks.关键词
复杂网络/节点识别/K-shell算法/二阶邻居Key words
complex network/node identification/K-shell algorithm/second-order neighbor分类
自科综合引用本文复制引用
姚曦煜,谢玉峰..考虑二阶邻居信息的K-shell重要节点识别算法研究[J].现代信息科技,2025,9(1):40-44,5.
