TY - JOUR
T1 - Modeling and Designing Non-Pharmaceutical Interventions in Epidemics
T2 - A Submodular Approach
AU - Cheng, Shiyu
AU - Niu, Luyao
AU - Ramasubramanian, Bhaskar
AU - Clark, Andrew
AU - Poovendran, Radha
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2024
Y1 - 2024
N2 - This letter considers the problem of designing non-pharmaceutical intervention (NPI) strategies, such as masking and social distancing, to slow the spread of a viral epidemic. We formulate the problem of jointly minimizing the infection probabilities of a population and the cost of NPIs based on a Susceptible-Infected-Susceptible (SIS) propagation model. To mitigate the complexity of the problem, we consider a steady-state approximation based on the quasi-stationary (endemic) distribution of the epidemic, and prove that the problem of selecting a minimum-cost strategy to satisfy a given bound on the quasi-stationary infection probabilities can be cast as a submodular optimization problem, which can be solved in polynomial time using the greedy algorithm. We carry out experiments to examine effects of implementing our NPI strategy on propagation and control of epidemics on a Watts-Strogatz small-world graph network. We find the NPI strategy reduces the steady state of infection probabilities of members of the population below a desired threshold value.
AB - This letter considers the problem of designing non-pharmaceutical intervention (NPI) strategies, such as masking and social distancing, to slow the spread of a viral epidemic. We formulate the problem of jointly minimizing the infection probabilities of a population and the cost of NPIs based on a Susceptible-Infected-Susceptible (SIS) propagation model. To mitigate the complexity of the problem, we consider a steady-state approximation based on the quasi-stationary (endemic) distribution of the epidemic, and prove that the problem of selecting a minimum-cost strategy to satisfy a given bound on the quasi-stationary infection probabilities can be cast as a submodular optimization problem, which can be solved in polynomial time using the greedy algorithm. We carry out experiments to examine effects of implementing our NPI strategy on propagation and control of epidemics on a Watts-Strogatz small-world graph network. We find the NPI strategy reduces the steady state of infection probabilities of members of the population below a desired threshold value.
KW - Epidemics
KW - biological systems
KW - networked systems
KW - submodular optimization
UR - https://www.scopus.com/pages/publications/85210945456
U2 - 10.1109/LCSYS.2024.3507641
DO - 10.1109/LCSYS.2024.3507641
M3 - Article
AN - SCOPUS:85210945456
SN - 2475-1456
VL - 8
SP - 2601
EP - 2606
JO - IEEE Control Systems Letters
JF - IEEE Control Systems Letters
ER -