Controlling Epidemic Spread using Probabilistic Diffusion Models on Networks. (arXiv:2202.08296v1 [cs.DS])

The spread of an epidemic is often modeled by an SIR random process on a
social network graph. The MinINF problem for optimal social distancing involves
minimizing the expected number of infections, when we are allowed to break at
most $B$ edges; similarly the MinINFNode problem involves removing at most $B$
vertices. These are fundamental problems in epidemiology and network science.
While a number of heuristics have been considered, the complexity of these
problems remains generally open. In this paper, …

arxiv epidemic networks