An important node identification algorithm based on an improved structural hole and K-shell decomposition algorithm is proposed to identify important nodes that affect security in complex networks. We consider the global structure of a network and propose a network security evaluation index of important nodes that is free of prior knowledge of network organization based on the degree of nodes and nearest neighborhood information. A node information control ability index is proposed according to the structural hole characteristics of nodes. An algorithm ranks the importance of nodes based on the above two indices and the nodes’ local propagation ability. The influence of nodes on network security and their own propagation ability are analyzed by experiments through the evaluation indices of network efficiency, network maximum connectivity coefficient, and Kendall coefficient. Experimental results show that the proposed algorithm can improve the accuracy of important node identification; this analysis has applications in monitoring network security.

提出了一种基于改进的结构孔和K-shell分解算法的重要节点识别算法，用于识别影响复杂网络安全性的重要节点。我们考虑了网络的全局结构，并根据节点的程度和最近的邻居信息，提出了重要节点的网络安全评估指标，该指标没有网络组织的先验知识。根据节点的结构孔特性，提出了节点信息控制能力指标。该算法根据以上两个指标和节点的本地传播能力对节点的重要性进行排序。通过网络效率评估指标，通过实验分析了节点对网络安全及其自身传播能力的影响，网络最大连接系数和肯德尔系数。实验结果表明，该算法可以提高重要节点识别的准确性。该分析可用于监视网络安全性。