• DocumentCode
    115510
  • 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
  • fYear
    2014
  • fDate
    15-17 Dec. 2014
  • Firstpage
    4447
  • Lastpage
    4454
  • 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;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Decision and Control (CDC), 2014 IEEE 53rd Annual Conference on
  • Conference_Location
    Los Angeles, CA
  • Print_ISBN
    978-1-4799-7746-8
  • Type

    conf

  • DOI
    10.1109/CDC.2014.7040083
  • Filename
    7040083
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=115510