Searcharxiv⌕ Search

arXiv subjects

Philip E. Paré

Publications and source records attributed to Philip E. Paré.

50 records · Page 3Linked to original sources

The Impact of Vaccine Hesitancy on Epidemic Spreading

The COVID-19 pandemic has devastated the world in an unprecedented way, causing enormous loss of life. Time and again, public health authorities have urged people to become vaccinated to protect themselves and mitigate the spread of the disease. However, vaccine hesitancy has stalled vaccination levels in the United States. This study explores the effect of vaccine hesitancy on the spread of disease by introducing an SIRS-V$_κ$ model, with compartments of susceptible (S), infected (I), recovered (R), and vaccinated (V). We leverage the concept of carrying capacity to account for vaccine hesitancy by defining a vaccine confidence level $κ$, which is the maximum number of people that will become vaccinated during the course of a disease. The inverse of vaccine confidence is vaccine hesitance, $(\frac{1}κ)$. We explore the equilibria of the SIRS-V$_κ$ model and their stability, and illustrate the impact of vaccine hesitance on epidemic spread analytically and via simulations.

eess.SY↗

Parameter Estimation in Epidemic Spread Networks Using Limited Measurements

We study the problem of estimating the parameters (i.e., infection rate and recovery rate) governing the spread of epidemics in networks. Such parameters are typically estimated by measuring various characteristics (such as the number of infected and recovered individuals) of the infected populations over time. However, these measurements also incur certain costs, depending on the population being tested and the times at which the tests are administered. We thus formulate the epidemic parameter estimation problem as an optimization problem, where the goal is to either minimize the total cost spent on collecting measurements, or to optimize the parameter estimates while remaining within a measurement budget. We show that these problems are NP-hard to solve in general, and then propose approximation algorithms with performance guarantees. We validate our algorithms using numerical examples.

eess.SY↗

The Effect of Population Flow on Epidemic Spread: Analysis and Control

In this paper, we present a discrete-time networked SEIR model using population flow, its derivation, and assumptions under which this model is well defined. We identify properties of the system's equilibria, namely the healthy states. We show that the set of healthy states is asymptotically stable, and that the value of the equilibria becomes equal across all sub-populations as a result of the network flow model. Furthermore, we explore closed-loop feedback control of the system by limiting flow between sub-populations as a function of the current infected states. These results are illustrated via simulation based on flight traffic between major airports in the United States. We find that a flow restriction strategy combined with a vaccine roll-out significantly reduces the total number of infections over the course of an epidemic, given that the initial flow restriction response is not delayed.

eess.SY↗

Edge Deletion Algorithms for Minimizing Spread in SIR Epidemic Models

This paper studies algorithmic strategies to effectively reduce the number of infections in susceptible-infected-recovered (SIR) epidemic models. We consider a Markov chain SIR model and its two instantiations in the deterministic SIR (D-SIR) model and the independent cascade SIR (IC-SIR) model. We investigate the problem of minimizing the number of infections by restricting contacts under realistic constraints. Under moderate assumptions on the reproduction number, we prove that the infection numbers are bounded by supermodular functions in the D-SIR model and the IC-SIR model for large classes of random networks. We propose efficient algorithms with approximation guarantees to minimize infections. The theoretical results are illustrated by numerical simulations.

math.OC↗

Networked Multi-Virus Spread with a Shared Resource: Analysis and Mitigation Strategies

The paper studies multi-competitive continuous-time epidemic processes in the presence of a shared resource. We consider the setting where multiple viruses are simultaneously prevalent in the population, and the spread occurs due to not only individual-to-individual interaction but also due to individual-to-resource interaction. In such a setting, an individual is either not affected by any of the viruses, or infected by one and exactly one of the multiple viruses. We classify the equilibria into three classes: a) the healthy state (all viruses are eradicated), b) single-virus endemic equilibria (all but one viruses are eradicated), and c) coexisting equilibria (multiple viruses simultaneously infect separate fractions of the population). We provide i) a sufficient condition for exponential (resp. asymptotic) eradication of a virus; ii) a sufficient condition for the existence, uniqueness and asymptotic stability of a single-virus endemic equilibrium; iii) a necessary and sufficient condition for the healthy state to be the unique equilibrium; and iv) for the bi-virus setting (i.e., two competing viruses), a sufficient condition and a necessary condition for the existence of a coexisting equilibrium. Building on these analytical results, we provide two mitigation strategies: a technique that guarantees convergence to the healthy state; and, in a bi-virus setup, a scheme that employs one virus to ensure that the other virus is eradicated. The results are illustrated in a numerical study of a spread scenario in Stockholm city.

eess.SY↗

Maximizing Privacy in MIMO Cyber-Physical Systems Using the Chapman-Robbins Bound

Privacy breaches of cyber-physical systems could expose vulnerabilities to an adversary. Here, privacy leaks of step inputs to linear-time-invariant systems are mitigated through additive Gaussian noise. Fundamental lower bounds on the privacy are derived, which are based on the variance of any estimator that seeks to recreate the input. Fully private inputs are investigated and related to transmission zeros. Thereafter, a method to increase the privacy of optimal step inputs is presented and a privacy-utility trade-off bound is derived. Finally, these results are verified on data from the KTH Live-In Lab Testbed, showing good correspondence with theoretical results.

eess.SY↗

Controlling a Networked SIS Model via a Single Input over Undirected Graphs

This paper formulates and studies the problem of controlling a networked SIS model using a single input in which the network structure is described by a connected undirected graph. A necessary and sufficient condition on the values of curing and infection rates for the healthy state to be exponentially stable is obtained via the analysis of signed Laplacians when the control input is the curing budget of a single agent. In the case when the healthy state is stabilizable, an explicit expression for the minimum curing budget is provided. The utility of the algorithm is demonstrated using a simulation over a network of cities in the northeastern United States.

math.OC↗

Bounding Privacy Leakage in Smart Buildings

Smart building management systems rely on sensors to optimize the operation of buildings. If an unauthorized user gains access to these sensors, a privacy leak may occur. This paper considers such a potential leak of privacy in a smart residential building, and how it may be mitigated through corrupting the measurements with additive Gaussian noise. This corruption is done in order to hide the occupancy change in an apartment. A lower bound on the variance of any estimator that estimates the change time is derived. The bound is then used to analyze how different model parameters affect the variance. It is shown that the signal to noise ratio and the system dynamics are the main factors that affect the bound. These results are then verified on a simulator of the KTH Live-In Lab Testbed, showing good correspondence with theoretical results.

eess.SY↗

Going Viral: Stability of Consensus-Driven Adoptive Spread

The spread of new products in a networked population is often modeled as an epidemic. However, in the case of `complex' contagion, these models {do not capture nuanced, dynamic social reinforcement effects in adoption behavior}. In this paper, we investigate a model of complex contagion which allows a coevolutionary interplay between adoption, modeled as an SIS epidemic spreading process, and social reinforcement effects, modeled as consensus opinion dynamics. Asymptotic stability analysis of the all-adopt as well as the none-adopt equilibria of the combined opinion-adoption model is provided through the use of Lyapunov arguments. In doing so, sufficient conditions are provided which determine the stability of the `flop' state, where no one adopts the product and everyone's opinion of the product is least favorable, and the `hit' state, where everyone adopts and their opinions are most favorable. These conditions are shown to extend to the bounded confidence opinion dynamic under a stronger assumption on the model parameters. To conclude, numerical simulations demonstrate behavior of the model which reflect findings from the sociology literature on adoption behavior.

eess.SY↗

Model Boundary Approximation Method as a Unifying Framework for Balanced Truncation and Singular Perturbation Approximation

We show that two widely accepted model reduction techniques, Balanced Truncation and Balanced Singular Perturbation Approximation, can be derived as limiting approximations of a carefully constructed parameterization of Linear Time Invariant (LTI) systems by employing the Model Boundary Approximation Method (MBAM), a recent development in the Physics literature. This unifying framework of these popular model reduction techniques shows that Balanced Truncation and Balanced Singular Perturbation Approximation each correspond to a particular boundary point on a manifold, the "model manifold," which is associated with the specific choice of model parameterization and initial condition, and is embedded in a sample space of measured outputs, which can be chosen arbitrarily, provided that the number of samples exceeds the number of parameters. We also show that MBAM provides a novel way to interpolate between Balanced Truncation and Balanced Singular Perturbation Approximation, by exploring the set of approximations on the boundary of the manifold between the elements that correspond to the two model reduction techniques; this allows for alternative approximations of a given system to be found that may be better under certain conditions. The work herein suggests similar types of approximations may be obtainable in topologically similar places (i.e. on certain boundaries) on the model manifold of nonlinear systems if analogous parameterizations can be achieved, therefore extending these widely accepted model reduction techniques to nonlinear systems.

math.OC↗

Multi-Competitive Viruses over Static and Time--Varying Networks

Epidemic processes are used commonly for modeling and analysis of biological networks, computer networks, and human contact networks. The idea of competing viruses has been explored recently, motivated by the spread of different ideas along different social networks. Previous studies of competitive viruses have focused only on two viruses and on static graph structures. In this paper, we consider multiple competing viruses over static and dynamic graph structures, and investigate the eradication and propagation of diseases in these systems. Stability analysis for the class of models we consider is performed and an antidote control technique is proposed.

math.OC↗

Epidemic Processes over Time-Varying Networks

The spread of viruses in biological networks, computer networks, and human contact networks can have devastating effects; developing and analyzing mathematical models of these systems can be insightful and lead to societal benefits. Prior research has focused mainly on network models with static graph structures, however the systems being modeled typically have dynamic graph structures. Therefore to better understand and analyze virus spread, further study is required. In this paper, we consider virus spread models over networks with dynamic graph structures, and investigate the behavior of diseases in these systems. A stability analysis of epidemic processes over time-varying networks is performed, examining conditions for the disease free equilibrium, in both the deterministic and stochastic cases. We present simulation results, propose a number of corollaries based on these simulations, and discuss quarantine control via simulation.

math.OC↗

On the Analysis of a Continuous-Time Bi-Virus Model

Motivated by the spread of opinions on different social networks, we study a distributed continuous-time bi-virus model for a system of groups of individuals. An in-depth stability analysis is performed for more general models than have been previously considered, for the healthy and epidemic states. In addition, we investigate sensitivity properties of some nontrivial equilibria and obtain an impossibility result for distributed feedback control.

math.OC↗