Three faces of node importance in network epidemiology: Exact results for small graphs

  title={Three faces of node importance in network epidemiology: Exact results for small graphs},
  author={Petter Holme},
  journal={Physical Review. E},
  • Petter Holme
  • Published 22 August 2017
  • Computer Science
  • Physical Review. E
We investigate three aspects of the importance of nodes with respect to susceptible-infectious-removed (SIR) disease dynamics: influence maximization (the expected outbreak size given a set of seed nodes), the effect of vaccination (how much deleting nodes would reduce the expected outbreak size), and sentinel surveillance (how early an outbreak could be detected with sensors at a set of nodes). We calculate the exact expressions of these quantities, as functions of the SIR parameters, for all… 

Figures from this paper

Beyond ranking nodes: Predicting epidemic outbreak sizes by network centralities
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.
Efficient sentinel surveillance strategies for preventing epidemics on networks
This paper addresses the question of which nodes the authors should select in a network of individuals susceptible to some infectious disease in order to minimize the number of casualties by simulating disease outbreaks on a collection of empirical and synthetic networks and shows that the best strategy depends on topological characteristics of the network.
Epidemic threshold in pairwise models for clustered networks: closures and fast correlations
By exploiting the presence of fast variables and using some standard techniques from perturbation theory, a class of models known as pairwise models where no analytical result for the epidemic threshold exists is shown to be able to be obtained analytically.
Evaluating strategies for spatial allocation of vaccines based on risk and centrality
It is concluded that, when a pathogen has high spreading capacity, or when vaccine availability is limited, centrality-targeting strategies should be considered as an alternative to the more commonly used risk- targeting strategies.
Temporal Cascade Model for Analyzing Spread in Evolving Networks with Disease Monitoring Applications
The proposed T-IC model is developed and shown to be highly effective in quantifying the importance of superspreaders, designing targeted restrictions for controlling spread, and backward contact tracing, and the impact of various intervention strategies over real spatio-temporal contact networks.
Evaluating link significance in maintaining network connectivity based on link prediction.
Inspired by the weak tie phenomenon, link prediction algorithms are introduced to define the dissimilarity of nodes based solely on the network topology and demonstrate that the method is especially effective in the networks with higher clustering coefficients.
The fastest spreader in SIS epidemics on networks
It is shown that the fastest spreader may change with the effective infection rate of a SIS epidemic process, which means that the time-dependent influence of a node is usually strongly coupled to the dynamic process and the underlying network.
Vaccination strategies on dynamic networks with indirect transmission links and limited contact information
This paper presents a novel vaccination strategy which relies on coarse-grained contact information, both direct and indirect, that can be easily and efficiently collected, and achieves comparable performance to the contact-degree based approach and outperforms other existing strategies without requiring over-detailed information.
Immunization strategies in networks with missing data
The results suggest that global immunization strategies, like degree immunization, are optimal in most cases; the exception is at very high levels of missing data, where stochastic strategies begin to outstrip them in minimizing outbreaks.


Ranking influential spreaders is an ill-defined problem
This work shows that a greedy heuristic does not necessarily work: the set of most influential nodes depends on the number of nodes in the set, and proposes a method for quantifying the extent and impact of this phenomenon.
Cost-efficient vaccination protocols for network epidemiology
This work investigates methods to vaccinate contact networks—i.e. removing nodes in such a way that disease spreading is hindered as much as possible—with respect to their cost-efficiency, and finds the so-called acquaintance vaccination is the most cost efficient.
Graphs with specified degree distributions, simple epidemics, and local vaccination strategies
Consider a random graph, having a prespecified degree distribution F, but other than that being uniformly distributed, describing the social structure (friendship) in a large community. Suppose that
Social Network Sensors for Early Detection of Contagious Outbreaks
This paper proposes an alternative strategy that does not require ascertainment of global network structure, namely, simply monitoring the friends of randomly selected individuals, which could in principle be generalized to other biological, psychological, informational, or behavioral contagions that spread in networks.
Fundamental difference between superblockers and superspreaders in networks
An extensive analysis over a large set of real-world networks is performed to test the similarity between sets of superblockers and of superspreaders, and shows that the two optimization problems are not equivalent: superblocker do not act as optimal spreaders.
Maximizing the spread of influence through a social network
An analysis framework based on submodular functions shows that a natural greedy strategy obtains a solution that is provably within 63% of optimal for several classes of models, and suggests a general approach for reasoning about the performance guarantees of algorithms for these types of influence problems in social networks.
Optimizing surveillance for livestock disease spreading through animal movements
This work characterizes livestock epidemics in terms of robust features useful for planning and control, to deal with temporal fluctuations, sensitivity to initial conditions and missing information during an outbreak, by focusing on the case study of cattle displacements in Italy.
Epidemic processes in complex networks
A coherent and comprehensive review of the vast research activity concerning epidemic processes is presented, detailing the successful theoretical approaches as well as making their limits and assumptions clear.
Directionality of contact networks suppresses selection pressure in evolutionary dynamics.
  • N. Masuda
  • Biology
    Journal of theoretical biology
  • 2009