Sequential Vaccination for Containing Epidemics
Tennenholtz, G.; Caramanis, C.; Mannor, S.
Show abstract
The dynamics of infectious diseases spread is crucial in determining their risk and offering ways to contain them. We study sequential vaccination of individuals in networks, where there is a limit on the number of individuals that can be vaccinated every day. Effective allocation of vaccine will play a critical role in preventing the spread and reducing the effects of a future pandemic. We derive methods for calculating upper and lower bounds of the expected number of infected individuals, as well as provide estimates on the number of vaccinations that is needed for containment. We calculate these explicitly on trees, d-dimensional grids, and Erd[o]s Renyi graphs. Finally, we construct a time-dependent budget allocation strategy and demonstrate its superiority over constant budget allocation on real networks following first acquaintance vaccination. Our results provide a principled approach to assess the needed vaccination rate given the social graph topology.
Matching journals
The top 6 journals account for 50% of the predicted probability mass.
Similar papers in this journal
- Beyond R0: Heterogeneity in secondary infections and probabilistic epidemic forecasting 95%
- Computing and Optimizing Over All Fixed-Points of Discrete Systems on Large Networks 95%
- Efficient Manipulation and Generation of Kirchhoff Polynomials for the Analysis of Non-equilibrium Biochemical Reaction Networks 95%
Similar papers in this journal
"Similar papers" are the closest papers from that journal in the model's embedding space. They show what the match is built on, but the ranking comes mostly from a classifier over the whole training set, not from these examples alone.