Efficient local strategies for vaccination and network attack

  title={Efficient local strategies for vaccination and network attack},
  author={Petter Holme},
  • P. Holme
  • Published 16 March 2004
  • Mathematics
  • EPL
We study how a fraction of a population should be vaccinated to most efficiently stop epidemics. Our starting point is that only local information-about the neighborhood of specific vertices-is usa ... 

Figures and Tables from this paper

Containing epidemic outbreaks by message-passing techniques
Computational epidemiology uses algorithms to identify and eradicate viruses. Researchers investigate targeted immunization as an optimization problem for a given choice of parameters and costs.
A dissemination strategy for immunizing scale-free networks
This work introduces a method, based on vaccine dissemination, that seems to reflect more accurately what is expected to occur in real-world networks, and is seen to render the network practically invulnerable to attacks while requiring only a small fraction of the nodes to receive the vaccine.
Robustness of networks against propagating attacks under vaccination strategies
It is shown that, when vaccines are inefficient, the random graph is more robust against propagating attacks than the scale-free network and the random graphs with the random defense are more robust than the size-based network with the degree-based defense.
Immunization of Geographical Networks
The results suggest that within the limitation of the network models considered here, in which the infection probability is assumed to decrease with the geographic distance, the simple SN strategy works almost equally or better than the CN strategy, especially when the detection time is longer.
Non massive immunization to contain spreading on complex networks
It is reported that moderate and weakly supervised immunizations can lead to finite epidemic thresholds of the susceptible-infected-susceptible model on scale-free networks by changing the nature of the transition from a specific motif to a collectively driven process.
Evolutionary Algorithm for Optimal Vaccination Scheme
The following work uses the dynamic capabilities of an evolutionary algorithm in order to obtain an optimal immunization strategy in a user specified network. The produced algorithm uses a basic
An Efficient Immunization Strategy Using Overlapping Nodes and Its Neighborhoods
Comparisons with alternative local immunization strategies using the fraction of the Largest Connected Component (LCC) after immunization, show that the proposed method is much more efficient and compares favorably to global measures such as degree and betweenness centrality.


Efficient immunization strategies for computer networks and populations.
It is shown that the immunization threshold is dramatically reduced with the suggested strategy, for all studied cases, and analytically the critical threshold for complete immunization is studied.
Random graphs
  • A. Frieze
  • Mathematics, Computer Science
    SODA '06
  • 2006
Some of the major results in random graphs and some of the more challenging open problems are reviewed, including those related to the WWW.
Attack vulnerability of complex networks.
It is found that the removals by the recalculated degrees and betweenness centralities are often more harmful than the attack strategies based on the initial network, suggesting that the network structure changes as important vertices or edges are removed.
Infectious disease epidemiology.
The development of antibiotics, improved access to safe food, clean water, sewage disposal and vaccines has led to dramatic progress in controlling infectious diseases, but some have become established in both the developed and developing world.
The Structure and Function of Complex Networks
Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.
Modern Infectious Disease Epidemiology
What Is Special About Infectious Disease Epidemiology? Definitions Risk, Relative Risk and Attack Rate Descriptive Epidemiology The Case-Control Study: Odds, Odds Ratios. The Concepts of Confounding
Emergence of scaling in random networks
A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
Assortative mixing in networks.
  • M. Newman
  • Computer Science
    Physical review letters
  • 2002
This work proposes a model of an assortatively mixed network and finds that networks percolate more easily if they are assortative and that they are also more robust to vertex removal.
Networking the seceder model: Group formation in social and economic systems.
  • A. Grönlund, P. Holme
  • Economics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
The original, agent based, seceder model is turned into a model of network evolution and it is found that the structural characteristics of the model closely match empirical social networks.