Table of Contents
Fetching ...

Modeling and Designing Non-Pharmaceutical Interventions in Epidemics: A Submodular Approach

Shiyu Cheng, Luyao Niu, Bhaskar Ramasubramanian, Andrew Clark, Radha Poovendran

TL;DR

The paper tackles designing cost-effective non-pharmaceutical interventions (NPIs) to slow an epidemic on a networked SIS model by leveraging a mean-field, quasi-stationary endemic distribution with ${\mathcal{R}_0 = \rho(D^{-1}BA)}$ as the outbreak threshold. It introduces cluster-based NPIs that reduce edge weights to ${a_{ij}(\overline{S})}$ and proves that the end-state constraint can be relaxed into a submodular, greedy-optimizable form, yielding a submodular-cost submodular-cover (SCSC) problem with provable guarantees. The authors provide a detailed formulation of the cost components ${\mathcal{C}_1,\mathcal{C}_2,\mathcal{C}_3}$ and demonstrate the submodular structure, enabling scalable solution via greedy surrogates. Through simulations on Watts-Strogatz networks, the method achieves substantial infection reduction relative to baselines while reducing NPI costs, illustrating practical applicability for public-health decision-making. The work thus offers a principled, scalable framework for cluster-based NPIs that balances epidemiological impact and economic considerations.

Abstract

This paper 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.

Modeling and Designing Non-Pharmaceutical Interventions in Epidemics: A Submodular Approach

TL;DR

The paper tackles designing cost-effective non-pharmaceutical interventions (NPIs) to slow an epidemic on a networked SIS model by leveraging a mean-field, quasi-stationary endemic distribution with as the outbreak threshold. It introduces cluster-based NPIs that reduce edge weights to and proves that the end-state constraint can be relaxed into a submodular, greedy-optimizable form, yielding a submodular-cost submodular-cover (SCSC) problem with provable guarantees. The authors provide a detailed formulation of the cost components and demonstrate the submodular structure, enabling scalable solution via greedy surrogates. Through simulations on Watts-Strogatz networks, the method achieves substantial infection reduction relative to baselines while reducing NPI costs, illustrating practical applicability for public-health decision-making. The work thus offers a principled, scalable framework for cluster-based NPIs that balances epidemiological impact and economic considerations.

Abstract

This paper 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.

Paper Structure

This paper contains 9 sections, 8 theorems, 18 equations, 1 figure, 1 table.

Key Result

Theorem 1

Suppose that $\mathcal{R}_{0}(\overline{S})\geq 1$. The nonzero steady-state infection probability of any node $i$ can be expressed as a continued fraction where $\mu_{i}=\frac{1}{\gamma_{i}}$ and $d_{i} = \sum_{j \in N(i)}{\lambda_{ij}(\overline{S})}$.

Figures (1)

  • Figure 1: Infection probabilities of 100 individuals in the absence (left) and presence (right) of NPI strategies over time relative to the desired endemic state value (red dotted horizontal line). When NPI strategies are not implemented, the infection probability of individuals converges to the interval $[0.34, 0.73]$. All individuals in this case have a significantly higher infection probability than the desired value of $0.05$. We compute an NPI strategy by solving (\ref{['eq:relax-quasi-stationary-problem']}) using the greedy algorithm. Fig. \ref{['fig:post-NPI']} shows that when this NPI strategy is applied to $11$ clusters with $81$ nodes, infection probabilities converge to the interval $[0,\ 0.08]$, which is much lower than the desired endemic state of $0.4$.

Theorems & Definitions (14)

  • Theorem 1: van2008virus
  • Theorem 2
  • proof
  • Proposition 1
  • proof
  • Lemma 1
  • proof
  • Lemma 2
  • proof
  • Proposition 2
  • ...and 4 more