A lower bound on the performance of dynamic curing policies for epidemics on graphs

Author(s)
Drakopoulos, Kimon; Koksal, Asuman E.; Tsitsiklis, John N
Thumbnail
DownloadOzdaglar_A lower bound.pdf (225.0Kb)
OPEN_ACCESS_POLICY
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
We consider an SIS-type epidemic process that evolves on a known graph. We assume that a fixed curing budget can be allocated at each instant to the nodes of the graph, towards the objective of minimizing the expected extinction time of the epidemic. We provide a lower bound on the optimal expected extinction time as a function of the available budget, the epidemic parameters, the maximum degree, and the CutWidth of the graph. For graphs with large CutWidth (close to the largest possible), and under a budget which is sublinear in the number of nodes, our lower bound scales exponentially with the size of the graph.
Date issued
2016-02
URI
http://hdl.handle.net/1721.1/111682
Department
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Journal
2015 54th IEEE Conference on Decision and Control (CDC)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Drakopoulos, Kimon et al. “A Lower Bound on the Performance of Dynamic Curing Policies for Epidemics on Graphs.” 2015 54th IEEE Conference on Decision and Control (CDC), December 15-18 2015, Osaka, Japan, Institute of Electrical and Electronics Engineers (IEEE), February 2016: 3560-3567 © 2015 Institute of Electrical and Electronics Engineers (IEEE)
Version: Original manuscript
ISBN
978-1-4799-7886-1
Collections