Affiliation:
1. Software College, Shenyang University of Technology of China, Shenyang 110870, China
2. Software College, Northeastern University of China, Shenyang 110819, China
Abstract
The heterogeneous nature indicates that different nodes may play different roles in network structure and function. Identifying influential spreaders is crucial for understanding and controlling the spread processes of epidemic, information, innovations, and so on. So how to identify influential spreaders is an urgent and crucial issue of network science. In this paper, we propose a novel local-information-based method, which can obtain the degree information of nodes’ higher-order neighbors by only considering the directly connected neighbors. Specifically, only a few iterations are needed to be executed, the degree information of nodes’ higher-order neighbors can be obtained. In particular, our method has very low computational complexity, which is very close to the degree centrality, and our method is of great extensibility, with which more factors can be taken into account through proper modification. In comparison with the well-known state-of-the-art methods, experimental analyses of the Susceptible-Infected-Recovered (SIR) propagation dynamics on ten real-world networks evidence that our method generally performs very competitively.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference49 articles.
1. Newman, M.E.J. (2018). Networks, Oxford University Press. [2nd ed.].
2. Wang, X.F., Li, X., and Chen, G.R. (2012). Network Science: An Introduction, Higher Education Press.
3. Vital nodes identification in complex networks;Chen;Phys. Rep.,2016
4. Scale-free networks: A decade and beyond;Science,2009
5. Error and attack tolerance of complex networks;Albert;Nature,2000