This article reviews and presents various solved and open problems in the development, analysis, and control of epidemic models. The proper modeling and analysis of spreading processes has been a long-standing area of research among many different fields, including mathematical biology, physics, computer science, engineering, economics, and the social sciences. One of the earliest epidemic models conceived was by Daniel Bernoulli in 1760, which was motivated by studying the spread of smallpox [1]. In addition to Bernoulli, there were many different researchers also working on mathematical epidemic models around this time [2]. These initial models were quite simplistic, and the further development and study of such models dates back to the 1900s [3]-[6], where still-simple models were studied to provide insight into how various diseases can spread through a population. In recent years, there has been a resurgence of interest in these problems as the concept of "networks" becomes increasingly prevalent in modeling many different aspects of the world today. A more comprehensive review of the history of mathematical epidemiology can be found in [7] and [8].
This paper proposes and analyzes a generalized epidemic model over arbitrary directed graphs with heterogeneous nodes. The proposed model, called the generalized-susceptible exposed infected vigilant, subsumes a large number of popular epidemic models considered in the literature as special cases. Using a mean-field approximation, we derive a set of ODEs describing the spreading dynamics, provide a careful analysis of the disease-free equilibrium, and derive necessary and sufficient conditions for global exponential stability. Building on this analysis, we consider the problem of containing an initial epidemic outbreak under budget constraints. More specifically, we consider a collection of control actions (e.g., administering vaccines/antidotes, limiting the traffic between cities, or running awareness campaigns), for which we are given suitable cost functions. In this context, we develop an optimization framework to provide solutions for the following two allocation problems: 1) find the minimum cost required to eradicate the disease at a desired exponential decay rate, and 2) given a fixed budget, find the resource allocation to eradicate the disease at the fastest possible exponential decay rate. Our technical approach relies on the reformulation of these problems as geometric programs that can be solved efficiently in polynomial time using tools from graph theory and convex optimization. In contrast with previous works, our optimization framework allows us to simultaneously allocate different types of control resources over heterogeneous populations under budget constraints. We illustrate our results through numerical simulations.
We consider a competitive epidemic process in a bilayer network, and develop a framework to find an optimal allocation of control resources to eliminate one of the epidemics. We consider the SI 1 SI 2 S model, a recent generalization of the popular SIS model to the case of two competitive epidemics. We start our analysis by extending the standard SI 1 SI 2 S formulation with homogeneous parameters to a heterogeneous setting with edge-dependent infection rates, and node-dependent recovery rates. We then find necessary and sufficient conditions under which the mean-field approximation of a chosen epidemic process stabilizes to extinction exponentially quickly. Leveraging this result, we develop a framework for the solution of two optimization problems. In the first, we find an optimal allocation of control resources in order to eradicate the chosen epidemic at a minimum cost. In the second, we are given a fixed budget and propose a method which provably attains the extinction condition when sufficient capital is available, and otherwise mitigates the spread of the unwanted epidemic as much as possible. We explore the efficacy of our methods through extensive simulation.
1 September 2020 in IEEE Transactions on Automatic Control
This article revisits the classical multiagent average consensus problem for which many different event-triggered control strategies have been proposed over the last decade. Many of the earliest versions of these works conclude asymptotic stability without proving that Zeno behavior, or deadlocks, do not occur along the trajectories of the system. More recent works that resolve this issue either: propose the use of a dwell time that forces interevent times to be lower bounded away from zero but sacrifice asymptotic convergence in exchange for practical convergence (or convergence to a neighborhood); guarantee non-Zeno behaviors and asymptotic convergence but do not provide a positive minimum interevent time guarantee; or are not fully distributed. Additionally, the overwhelming majority of these works provide no form of robustness analysis on the event-triggering strategy. More specifically, if arbitrarily small disturbances can remove the non-Zeno property then the theoretically correct algorithm may not actually be implementable. Instead, this article for the first time presents a fully distributed, robust, dynamic event-triggered algorithm, for general directed communication networks, for which a desired positive minimum interevent time can be chosen by each agent in a distributed fashion. Simulations illustrate our results.