Mining and Ranking Important Nodes in Complex Network by K-Shell and Degree Difference

Abstract

Identifying important nodes in complex networks can help us effectively design protection strategies, improve the security and protection capabilities of network hub nodes, and enhance the network survivability and structural stability. In view of nodes partition being too coarse by the k-shell decomposition method, this paper proposes a new index named k-shell and degree difference, which considers the network node location, the local characteristics of the node and its neighbors and the impact of multi-level nodes on it. In this paper, the network efficiency index is used to quantify the impact of the node removal on the network structure and function, and the destruction-resistance experiment is carried out in four actual networks. Experimental results show that the method proposed in this paper is more accurately to assess the importance of nodes than other four methods.