8 citations · 17 across the 4 of their papers we have counts for
3 papers · 1 filter
A lower bound on the performance of dynamic curing policies for epidemics on graphs
Kimon Drakopoulos, Asuman Ozdaglar, John N. Tsitsiklis
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…
When is a network epidemic hard to eliminate?
Kimon Drakopoulos, Asuman Ozdaglar, John N. Tsitsiklis
We consider the propagation of a contagion process (epidemic) on a network and study the problem of dynamically allocating a fixed curing budget to the nodes of the graph, at each…
An efficient curing policy for epidemics on graphs
Kimon Drakopoulos, Asuman Ozdaglar, John N. Tsitsiklis
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 budge…