Sciweavers

Share
CDC
2015
IEEE

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

2 years 8 months ago
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 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.
Kimon Drakopoulos, Asuman E. Ozdaglar, John N. Tsi
Added 18 Apr 2016
Updated 18 Apr 2016
Type Journal
Year 2015
Where CDC
Authors Kimon Drakopoulos, Asuman E. Ozdaglar, John N. Tsitsiklis
Comments (0)
books