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...
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: | |
Online Access: | Get fulltext |
Similar Items
-
When Is a Network Epidemic Hard to Eliminate?
by: Drakopoulos, Kimon, et al.
Published: (2017) -
A lower bound for distributed averaging algorithms on the line graph
by: Tsitsiklis, John N., et al.
Published: (2012) -
On Learning With Finite Memory
by: Drakopoulos, Kimon, et al.
Published: (2014) -
Lower bounds for the energy of graphs
by: Akbar Jahanbani
Published: (2018-04-01) -
Lower bounds for the energy of graphs
by: Akbar Jahanbani
Published: (2018-04-01)