Title :
An efficient curing policy for epidemics on graphs
Author :
Drakopoulos, Kimon ; Ozdaglar, Asuman ; Tsitsiklis, John
Author_Institution :
Lab. of Inf. & Decision Syst., Massachusetts Inst. of Technol., Cambridge, MA, USA
Abstract :
This paper provides an implementable dynamic policy for the rapid containment of a contagious process modeled as an SIS epidemic. We show that for graphs with low CutWidth (sublinear) rapid containment defined as achieving sublinear expected extinction time for the epidemic is feasible with sublinear budget and is achieved by this policy.
Keywords :
computational complexity; epidemics; graph theory; CutWidth rapid containment; SIS epidemic; contagious process containment; curing policy; dynamic policy; graph; sublinear budget; sublinear expected extinction time; Curing; History; Markov processes; Measurement; Merging; Process control; Resistance;
Conference_Titel :
Decision and Control (CDC), 2014 IEEE 53rd Annual Conference on
Conference_Location :
Los Angeles, CA
Print_ISBN :
978-1-4799-7746-8
DOI :
10.1109/CDC.2014.7040083
