An improved K-Shell-Based Ranking of Node Importance

Abstract

Identifying important nodes in complex networks in a fast and effective manner is one of the useful ways to control the network communication process. Degree centrality and K-Shell decomposition are combined to integrate the global and local characteristics of the nodes, without depending on other parameters in the calculation. This effectively improves the shortcomings of poor discrimination by K-Shell decomposition and increases the resolution of node identification.