Identifying influential spreaders in complex network based on the node’s weight and spreading probability

Abstract

Identifying influential spreaders is a crucial aspect of network science with various applications, including rumor control, viral marketing and epidemic spread limitation. Despite the availability of various methods for identifying these spreaders in complex networks, there remains a fundamental question regarding their accurate and discriminative identification. To address the issues and account for each node’s propagation ability, we propose an algorithm to identify influential spreaders based on the node’s weight and spreading probability (NWSP) for identifying influential spreaders. The effectiveness of the proposed method is evaluated using the Susceptible–Infected–Recovered (SIR) model, Kendall’s Tau ([Formula: see text]) and monotonicity. The proposed method is compared with several well-known metrics, including degree centrality, K-shell decomposition, betweenness centrality, closeness centrality, eigenvector centrality and the centrality method based on node spreading probability (SPC), in ten real networks. Experimental results demonstrate the superiority ability of the proposed algorithm to accurately and discriminatively identify influential spreaders.