Efficient Immunization Strategies for Computer Networks and Populations

dc.creatorCohen, Reuven
dc.creatorHavlin, Shlomo
dc.creatorben-Avraham, Daniel
dc.date2002-07-16
dc.date2003-12-10
dc.date.accessioned2026-07-07T02:46:17Z
dc.date.available2026-07-07T02:46:17Z
dc.descriptionWe present an effective immunization strategy for computer networks and populations with broad and, in particular, scale-free degree distributions. The proposed strategy, acquaintance immunization, calls for the immunization of random acquaintances of random nodes (individuals). The strategy requires no knowledge of the node degrees or any other global knowledge, as do targeted immunization strategies. We study analytically the critical threshold for complete immunization. We also study the strategy with respect to the susceptible-infected-removed epidemiological model. We show that the immunization threshold is dramatically reduced with the suggested strategy, for all studied cases.
dc.descriptionRevtex, 5 pages, 4 ps figs
dc.identifierhttps://arxiv.org/abs/cond-mat/0207387
dc.identifierhttp://arxiv.org/abs/cond-mat/0207387
dc.identifierPhys. Rev. Lett. 91, 247901 (2003)
dc.identifierdoi:10.1103/PhysRevLett.91.247901
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/19614
dc.subjectDisordered Systems and Neural Networks
dc.subjectPopulations and Evolution
dc.titleEfficient Immunization Strategies for Computer Networks and Populations
dc.typetext

Files

Collections