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

@article{Bauer2012IdentifyingIS,
  title={Identifying influential spreaders and efficiently estimating infection numbers in epidemic models: A walk counting approach},
  author={Frank Bauer and Joseph T. Lizier},
  journal={EPL},
  year={2012},
  volume={99},
  pages={68007}
}
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… 

Figures from this paper

Spreading to localized targets in complex networks
TLDR
Simulation results show that the proposed reversed local path algorithm outperforms the existing methods in identifying the influential nodes with respect to localized targets in complex networks and can effectively avoid infecting the non-target nodes in the spreading process.
Beyond ranking nodes: Predicting epidemic outbreak sizes by network centralities
TLDR
This work investigates how well the position of a node, characterized by standard network measures, can predict its epidemiological importance in any graph of a given number of nodes to find that combinations of two or more centralities are predictive even for the most difficult parameter values of the epidemic simulation.
The spreading ability of nodes towards localized targets in complex networks
TLDR
Simulation results show that the reversed local path algorithm outperforms the existing methods in identifying the influential nodes with respect to these localized targets and the influential spreaders identified by the method can effectively avoid infecting the non-target nodes in the spreading process.
Leveraging percolation theory to single out influential spreaders in networks
TLDR
It is proved that the recently introduced nonbacktracking centrality is the optimal criterion for the identification of influential spreaders in locally tree-like networks at criticality and is a highly reliable metric to identify top influential spreader also in generic graphs not embedded in space and for noncritical spreading.
Spreading dynamics in complex networks
TLDR
Some of the most important theoretical models that describe spreading processes are displayed, and the problem of locating both the individual and multiple influential spreaders respectively are discussed.
Identifying an influential spreader from a single seed in complex networks via a message-passing approach
TLDR
The problem of finding important spreaders is directly tackled by solving analytically the expected size of epidemic outbreaks when spreading originates from a single seed using a message-passing approach and the approach can be successfully adapted into weighted networks.
Accurate prediction of influential spreaders in complex networks via message-passing approach
TLDR
The problem of finding important spreaders is directly tackled by solving analytically the expected size of epidemic outbreaks when spreading originates from a single seed using message-passing approach and it is shown that the approach can be successfully adapted into weighted networks.
Identifying Top-K Important Nodes Based on Probabilistic-Jumping Random Walk in Complex Networks
TLDR
Experimental results suggest that the PJRW method can effectively find the important top-k nodes and its result in most networks is better than degree, betweenness, closeness and eigenvector centrality.
Dynamic communicability and epidemic spread: a case study on an empirical dynamic contact network
TLDR
It is shown that temporal centrality identifies a distinct set of top-spreaders than centrality based on the time-aggregated binarized contact matrix, so that taken together, the accuracy of capturing top- spreaders improves significantly and the temporal measure does not necessarily outperform less complex measures.
Percolation Centrality: Quantifying Graph-Theoretic Impact of Nodes during Percolation in Networks
TLDR
A new measure is proposed that quantifies relative impact of nodes based on their topological connectivity, as well as their percolation states, that can be extended to include random walk based definitions and its computational complexity is shown to be of the same order as that of betweenness centrality.
...
...

References

SHOWING 1-10 OF 32 REFERENCES
Spread of epidemic disease on networks.
  • M. Newman
  • Mathematics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2002
TLDR
This paper shows that a large class of standard epidemiological models, the so-called susceptible/infective/removed (SIR) models can be solved exactly on a wide variety of networks.
Universal behavior in a generalized model of contagion.
TLDR
A general model of contagion is introduced which, by explicitly incorporating memory of past exposures to, for example, an infectious agent, rumor, or new product, includes the main features of existing contagion models and interpolates between them.
Breakdown of the internet under intentional attack.
TLDR
It is argued that, near criticality, the average distance between sites in the spanning (largest) cluster scales with its mass, M, as square root of [M], rather than as log (k)M, as expected for random networks away from criticality.
Diffusion of scientific credits and the ranking of scientists
TLDR
This work takes advantage of the entire Physical Review publication archive to construct authors' networks where weighted edges, as measured from opportunely normalized citation counts, define a proxy for the mechanism of scientific credit transfer.
Self-similar community structure in a network of human interactions.
TLDR
The results reveal the self-organization of the network into a state where the distribution of community sizes is self-similar, suggesting that a universal mechanism, responsible for emergence of scaling in other self-organized complex systems, as, for instance, river networks, could also be the underlying driving force in the formation and evolution of social networks.
Quantifying the influence of scientists and their publications: Distinguish prestige from popularity
TLDR
This paper argues that from whom the paper is being cited is of higher significance than merely the number of received citations, and proposes an interactive model on author-paper bipartite networks as well as an iterative algorithm to get better rankings for scientists and their publications.
Fast algorithm for detecting community structure in networks.
  • M. Newman
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
TLDR
An algorithm is described which gives excellent results when tested on both computer-generated and real-world networks and is much faster, typically thousands of times faster, than previous algorithms.
The Giant Component in a Random Subgraph of a Given Graph
TLDR
It is proved that for any e> 0, if $p > (1+ \epsilon)/{\tilde d}$ then asymptotically almost surely the percolated subgraph G p has a giant component.
The self-avoiding walk
The self-avoiding walk is a mathematical model with important applications in statistical mechanics and polymer science. This text provides a unified account of the rigorous results for the
Nature
  • R. Rosenfeld
  • Medicine
    Otolaryngology--head and neck surgery : official journal of American Academy of Otolaryngology-Head and Neck Surgery
  • 2009
...
...