Identifying and ranking influential spreaders in complex networks

Identifying influential spreaders is an important and fundamental work in control information diffusion. Many methods based on centrality measures such as degree centrality, the betweenness centrality, closeness centrality and eigenvector centrality are proposed in the previous literatures, and it has proved that the k-shell decomposition plays overwhelming performance to find influential spreaders in networks. However, as the performance of former three methods is not satisfying enough and k-shell decomposition cannot rank nodes in the same k-core how to find the influential spreaders is still an open challenge. In this paper, we concerned about the influence of μ hop neighborhoods on a node and propose a novel metric, k-shell values of μ hop neighborhoods (μ-
_NKS
), to estimate the spreading influence of nodes of each k- shell in networks. Our experimental results show that the proposed method can quantify the node influence more accurately and provide a more monotonic ranking list than other ranking methods.