Optimal Quarantining Strategy for Interdependent Epidemics Spreading over Complex Networks

Juntao Chen, Yunhan Huang, Rui Zhang, Quanyan Zhu

Abstract

Optimal curing strategy of suppressing competing epidemics spreading over complex networks is a critical issue. In this paper, we first establish a framework to capture the coupling between two epidemics, and then analyze the system's equilibrium states by categorizing them into three classes, and deriving their stability conditions. The designed curing strategy globally optimizes the trade-off between the curing cost and the severity of epidemics in the network. In addition, we provide structural results on the predictability of epidemic spreading by showing the existence and uniqueness of the solution. We also demonstrate the robustness of curing strategy by showing the continuity of epidemic severity with respect to the applied curing effort. A gradient descent algorithm based on a fixed-point iterative scheme is proposed to find the optimal curing strategy. Depending on the system parameters, the curing strategy can lead to switching between equilibria of the epidemic network as the control cost varies. Finally, we use case studies to corroborate and illustrate the obtained theoretical results.

Introduction

In traditional epidemiology, models often focus on the spread of a single pathogen. However, real-world scenarios frequently involve multiple "strains" or processes competing for the same susceptible population. This phenomenon is observed in biological contexts (e.g., different influenza strains), cybersecurity (competing malware variants), and economics (competing products in viral marketing).

The central challenge in managing these systems is their interdependence: an individual infected by Strain A cannot be simultaneously infected by Strain B. Consequently, a treatment that suppresses one strain might inadvertently create an ecological opening for the other to dominate. This paper addresses the problem of determining the most cost-effective allocation of recovery resources—such as vaccines or anti-virus updates—to drive a complex network toward a disease-free state or a manageable equilibrium.

Modeling Framework

The researchers utilize a Degree-Based Mean-Field (DBMF) approximation of the Susceptible-Infected-Susceptible (SIS) model. Unlike individual-based models that track every link in a network, DBMF groups nodes by their "degree" (the number of connections they possess). This approach makes the analysis computationally feasible for massive, large-scale networks while preserving the essential structural characteristics of the system.

The system's dynamics are governed by the interaction between the infection rates of the two strains and the curing rates ($u_1, u_2$) applied by the controller. To analyze the long-term behavior of these epidemics, the authors employ Lyapunov functions and eigenvalue analysis of linearized systems to determine the stability of various network states.

Equilibrium Analysis and the Non-Coexistence Phenomenon

A significant theoretical contribution of this work is the categorization of the system's equilibrium states into three classes:

  1. Disease-Free Equilibrium: Both strains are eradicated.
  2. Exclusive Equilibrium (Strain 1): Only Strain 1 survives.
  3. Exclusive Equilibrium (Strain 2): Only Strain 2 survives.

The authors prove a "non-coexistence" phenomenon: at a steady state, two competing strains cannot coexist within the same network. The system will inevitably settle into one of the three states mentioned above. Furthermore, the research identifies a "fulfilling threshold"—a specific level of control effort beyond which the network is guaranteed to reach a stable, disease-free equilibrium.

Interestingly, in the disease-free regime, the optimal strategy is found to be independent of the specific shape of the entire degree distribution. Instead, it depends primarily on the average degree and the second moment of the network connectivity.

Optimal Control Strategy

The paper formulates an optimization framework to minimize a global objective function. This function balances two competing factors:

  • Control Cost: The economic or logistical effort required to cure nodes.
  • Epidemic Severity: The total infected population across the network.

Because the steady-state equations are non-linear and coupled, the authors developed a gradient-descent algorithm based on a fixed-point iterative scheme. This algorithm allows for the identification of optimal curing rates that minimize the total cost. A notable finding is "equilibria switching": as the unit cost of curing changes (e.g., as a vaccine becomes cheaper), the optimal strategy may cause the network to "jump" between equilibria—for instance, moving from a state where Strain 1 is dominant to one where Strain 2 is dominant, before finally reaching a disease-free state.

Robustness and Validation

The framework was validated using synthetic Scale-Free (SF) networks generated via the Barabási-Albert model. These networks, consisting of 500 nodes with an average degree of approximately 1.996, mimic the "hub-and-spoke" architecture of real-world social and computer networks.

The results demonstrate two critical properties of the proposed strategy:

  1. Continuity: The epidemic's severity is continuous with respect to the curing effort. This implies that small errors or fluctuations in applying the control strategy will not lead to sudden, catastrophic outbreaks.
  2. Model Mismatch Resilience: Numerical experiments showed that even if the controller has an inaccurate model of the network (e.g., slightly incorrect connectivity statistics), a conservative control design can still successfully drive the system to the desired state.

Conclusion and Future Directions

This research provides a robust mathematical foundation for controlling interdependent epidemics on complex networks. While the current model focuses on the steady-state "long run," it sets the stage for future work in several areas. These include optimizing for the transient phase (the immediate period following an outbreak), accounting for "co-infection" where hosts carry multiple strains, and extending the framework to $N$ competing processes. Additionally, future iterations may explore adaptive curing strategies for environments where the network structure is not fully known to the operator.

Summary updated

Abstract

Optimal curing strategy of suppressing competing epidemics spreading over complex networks is a critical issue. In this paper, we first establish a framework to capture the coupling between two epidemics, and then analyze the system's equilibrium states by categorizing them into three classes, and deriving their stability conditions. The designed curing strategy globally optimizes the trade-off between the curing cost and the severity of epidemics in the network. In addition, we provide structural results on the predictability of epidemic spreading by showing the existence and uniqueness of the solution. We also demonstrate the robustness of curing strategy by showing the continuity of epidemic severity with respect to the applied curing effort. A gradient descent algorithm based on a fixed-point iterative scheme is proposed to find the optimal curing strategy. Depending on the system parameters, the curing strategy can lead to switching between equilibria of the epidemic network as the control cost varies. Finally, we use case studies to corroborate and illustrate the obtained theoretical results.
BibTeX
@article{chen2021optimal,
  author = {Juntao Chen and Yunhan Huang and Rui Zhang and Quanyan Zhu},
  title = {{Optimal Quarantining Strategy for Interdependent Epidemics Spreading over Complex Networks}},
  journal = {IEEE Trans. Signal Inf. Process. Over Networks},
  year = {2021},
  url = {https://openreview.net/forum?id=VRPCyDolfr},
}
Figure