Analysis of the spreading influence of the nodes with minimum K-shell value in complex networks

The K-shell decomposition for identifying influential nodes plays an important role in analyzing the spreading performance in complex networks, which generates lots of nodes with the smallest K-shell value. The spreading influences of these nodes cannot be distinguished by the K-shell decomposition method, as well as the degree and betweeness indices. In this paper, by taking into account the K-shell information of the target node, we develop a new method to identify the node spreading ability with the minimum K-shell value. The experimental results for pretty good privacy and autonomous system networks show that the presented method could generate more accurate spreading list than the degree and betweeness indices.