基于K-shell的关键节点识别算法

Key Node Identification Algorithm Based on K-shell

在复杂网络中,对各节点的影响力进行识别并找出其中的关键节点,对于研究病毒的传播与控制、电网故障控制与预警等具有重要作用.在对现有关键节点算法分析研究的基础上,提出了一种基于K-shell的关键节点识别算法(KNIK),该算法综合考虑节点的全局与局部信息,同时引入节点与邻居节点之间的关联度,计算节点在网络中的最终影响力.为了对算法性能进行验证,以SIR模型为参照进行仿真实验,实验结果表明,KNIK能够有效地检测节点的影响力,识别网络中的关键节点.

In complex network,identifying the influence of each node and finding out the key nodes are of great importance to the study of the spread and control of viruses and the control and early warning of power grid fault.On the basis of the analysis and research of existing key node algorithms,a key node identification algorithm KNIK based on K-shell is proposed.This algorithm comprehensively considers the global and local information of nodes,and introduces the correlation degree between nodes and neighbors to calculate the final influence of nodes in the network.In order to verify the performance of the algorithm,the SIR model is used as a reference to carry out simulation experiments.The experiments show that KNIK can effectively detect the influence of nodes and identify key points in the network.