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

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

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...

Full description

Bibliographic Details
Main Authors: Drakopoulos, Kimon (Contributor), Koksal, Asuman E. (Contributor), Tsitsiklis, John N (Contributor)
Other Authors: Massachusetts Institute of Technology. Laboratory for Information and Decision Systems (Contributor)
Format: Article
Language:English
Published: Institute of Electrical and Electronics Engineers (IEEE), 2017-10-03T18:26:11Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items