We study the effect of vaccination on the robustness of networks against propagating attacks that obey the susceptible–infected–removed model. By extending the generating function formalism developed by Newman (2005 Phys. Rev. Lett. 95 108701), we analytically determine the robustness of networks that depends on the vaccination parameters. We consider the random defense where nodes are vaccinated randomly and the degree-based defense where hubs are preferentially vaccinated. We show that, when vaccines are inefficient, the random graph is more robust against propagating attacks than the scale-free network. When vaccines are relatively efficient, the scale-free network with the degree-based defense is more robust than the random graph with the random defense and the scale-free network with the random defense.
Robustness of networks against propagating attacks under vaccination strategies
Published 2011 in arXiv.org
ABSTRACT
PUBLICATION RECORD
- Publication year
2011
- Venue
arXiv.org
- Publication date
2011-02-23
- Fields of study
Mathematics, Physics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-37 of 37 references · Page 1 of 1
CITED BY
Showing 1-9 of 9 citing papers · Page 1 of 1