Identifying influential spreaders and efficiently estimating infection numbers in epidemic models: a walk counting approach

Abstract

We introduce a new method to efficiently approximate the number of infections resulting from a given initially-infected node in a network of susceptible individuals. Our approach is based on counting the number of possible infection walks of various lengths to each other node in the network. We analytically study the properties of our method, in particular demonstrating different forms for SIS and SIR disease spreading (e.g. under the SIR model our method counts self-avoiding walks). In comparison to existing methods to infer the spreading efficiency of different nodes in the network (based on degree, k-shell decomposition analysis and different centrality measures), our method directly considers the spreading process and, as such, is unique in providing estimation of actual numbers of infections. Crucially, in simulating infections on various real-world networks with the SIR model, we show that our walks-based method improves the inference of effectiveness of nodes over a wide range of infection rates compared to existing methods. We also analyse the trade-off between estimate accuracy and computational cost, showing that the better accuracy here can still be obtained at a comparable computational cost to other methods.

6 pages

References in corpus (11)

• Error and attack tolerance of complex networks
• Epidemic spreading in scale-free networks
• Fast algorithm for detecting community structure in networks
• The spread of epidemic disease on networks
• Identification of influential spreaders in complex networks
• Self-similar community structure in organisations
• Breakdown of the Internet under intentional attack
• Leaders in Social Networks, the Delicious Case
• Universal behavior in a generalized model of contagion
• Diffusion of scientific credits and the ranking of scientists
• A measure of individual role in collective dynamics

Cited by in corpus (22)

• Epidemic processes in complex networks
• Vital nodes identification in complex networks
• Spreading dynamics in complex networks
• Identifying Influential Spreaders by Weighted LeaderRank
• Understanding the spreading power of all nodes in a network: a continuous-time perspective
• Identify influential spreaders in complex networks, the role of neighborhood
• Containing epidemic outbreaks by message-passing techniques
• Path diversity improves the identification of influential spreaders
• Leveraging percolation theory to single out influential spreaders in networks
• Identifying an influential spreader from a single seed in complex networks via a message-passing approach
• Accurate ranking of influential spreaders in networks based on dynamically asymmetric link-impact
• Beyond ranking nodes: Predicting epidemic outbreak sizes by network centralities
• Efficient detection of contagious outbreaks in massive metropolitan encounter networks
• Influencers identification in complex networks through reaction-diffusion dynamics
• Self-avoiding walks and connective constants in clustered scale-free networks
• Influence maximization in noisy networks
• Dynamic communicability and epidemic spread: a case study on an empirical dynamic contact network
• Finding the proper node ranking method for complex networks
• Informed Machine Learning, Centrality, CNN, Relevant Document Detection, Repatriation of Indigenous Human Remains
• Identifying Influential Nodes in Weighted Networks using k-shell based HookeRank Algorithm
• Calibratable Hetero-NodeRank for measuring node influence
• The spreading ability of nodes towards localized targets in complex networks