Robustness of networks against propagating attacks under vaccination strategies
arXiv:1102.4878 · doi:10.1088/1742-5468/2011/09/P09014
Abstract
We study the effect of vaccination on robustness of networks against propagating attacks that obey the susceptible-infected-removed model.By extending the generating function formalism developed by Newman (2005), 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.
16 pages, 7 figures
References in corpus (9)
- Critical phenomena in complex networks
- Efficient Immunization Strategies for Computer Networks and Populations
- Thresholds for epidemic spreading in networks
- Stability and topology of scale-free networks under attack and defense strategies
- Threshold effects for two pathogens spreading on a network
- Second look at the spread of epidemics on networks
- Predicting the size and probability of epidemics in a population with heterogeneous infectiousness and susceptibility
- Efficient local strategies for vaccination and network attack
- Improving immunization strategies