When Is a Network Epidemic Hard to Eliminate?
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 time instant. For bounded degree graphs, we provide a lower bound on the expected time to extinction under a...
Main Authors: | Drakopoulos, Kimon (Contributor), Koksal, Asuman E. (Contributor), Tsitsiklis, John N (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Laboratory for Information and Decision Systems (Contributor) |
Format: | Article |
Language: | English |
Published: |
Institute for Operations Research and the Management Sciences (INFORMS),
2017-08-28T18:03:43Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
A lower bound on the performance of dynamic curing policies for epidemics on graphs
by: Drakopoulos, Kimon, et al.
Published: (2017) -
On Learning With Finite Memory
by: Drakopoulos, Kimon, et al.
Published: (2014) -
Analysis and control of contagion processes on networks
by: Drakopoulos, Kimon
Published: (2016) -
Hardness of Low Delay Network Scheduling
by: Shah, Devavrat, et al.
Published: (2012) -
NP-Hardness of checking the unichain condition in average cost MDPs
by: Tsitsiklis, John N.
Published: (2012)