Identification of multiple influential spreaders on networks by percolation under the SIR model.

Identification of multiple influential spreaders on complex networks is of great significance, which can help us speed up information diffusion and prevent disease from spreading to some extent. The traditional top-k strategy to solve an influence maximization problem based on node centrality is unsuitable for selecting several spreaders simultaneously because of influence overlapping. Besides, other heuristic methods have a poor ability to keep the balance between efficiency and computing time. In this paper, an efficient method is proposed to identify the decentralized influential spreaders on networks by edge percolation under the Susceptible-Infected-Recovered (SIR) model. Thanks to the average size of the connected component where one node is located under the edge percolation equivalent to the final spread range of this node under the SIR model approximately, it inspires us to choose suitable spreaders maximize the spread of influence. The experimental results show that our method has high efficiency compared with other benchmark methods on three synthetic networks and six empirical networks, and it also requires less time and cost.