Identifying influential spreaders in complex networks by propagation probability dynamics

Numerous well-known processes of complex systems such as spreading and cascading are mainly affected by a small number of critical nodes. Identifying influential nodes that lead to broad spreading in complex networks is of great theoretical and practical importance. Since the identification of vital nodes is closely related to propagation dynamics, a novel method DynamicRank that employs the probability model to measure the ranking scores of no des is suggested. The influence of a node can be denoted by the sum of probability scores of its i order neighboring nodes. This simple yet effective method provides a new idea to understand the identification of vital nodes in propagation dynamics. Experimental studies on both Susceptible-Infected-Recovered and Susceptible-Infected-Susceptible models in real networks demonstrate that it outperforms existing methods such as Coreness, H-index, LocalRank, Betweenness, and Spreading Probability in terms of the Kendall tau coefficient. The linear time complexity enables it to be applied to real large-scale networks with tens of thousands of nodes and edges in a short time. Published under license by AIP Publishing.