An efficient curing policy for epidemics on graphs
Social and Information Networks
2014-07-10 v1
Abstract
We provide a dynamic policy for the rapid containment of a contagion process modeled as an SIS epidemic on a bounded degree undirected graph with n nodes. We show that if the budget of curing resources available at each time is , where is the CutWidth of the graph, and also of order , then the expected time until the extinction of the epidemic is of order , which is within a constant factor from optimal, as well as sublinear in the number of nodes. Furthermore, if the CutWidth increases only sublinearly with n, a sublinear expected time to extinction is possible with a sublinearly increasing budget .
Keywords
Cite
@article{arxiv.1407.2241,
title = {An efficient curing policy for epidemics on graphs},
author = {Kimon Drakopoulos and Asuman Ozdaglar and John N. Tsitsiklis},
journal= {arXiv preprint arXiv:1407.2241},
year = {2014}
}