考虑二阶邻居信息的K-shell重要节点识别算法研究  

Research on the K-shell Important Node Identification Algorithm Considering Second-order Neighbor Information

作　　者：姚曦煜 谢玉峰 YAO Xiyu;XIE Yufeng(Wuchang Institute of Technology,Wuhan 430065,China)

机构地区：[1]武昌工学院,湖北武汉430065

出　　处：《现代信息科技》2025年第1期40-44,共5页Modern Information Technology

摘　　要：在真实网络中,找出一些关键的节点进行保护能够有效维持系统的稳定,同时对于复杂网络中的病毒控制与传播、交通网络的故障控制、社交网络中影响力识别等都有重要作用。在现有关键节点识别算法K-shell的基础上,提出了一种考虑二阶邻居信息的K-shell的关键节点识别算法,该算法综合考虑节点的全局与局部信息,同时引入节点的一阶邻居节点和二阶邻居节点的相关信息,计算节点在网络中的重要性。为了验证该算法的性能,以随机攻击和蓄意攻击两种攻击方式在网络中的节点进行仿真实验,实验结果表明,考虑二阶邻居信息的K-shell方法能够有效地检测节点的重要性,识别网络中的关键节点。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 offirst-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算法 二阶邻居 

分 类 号：N945.12[自然科学总论—系统科学] N945.13