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 any such dy...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute for Operations Research and the Management Sciences (INFORMS)
2017
|
| Online Access: | http://hdl.handle.net/1721.1/111028 https://orcid.org/0000-0001-8288-5874 https://orcid.org/0000-0002-1827-1285 https://orcid.org/0000-0003-2658-8239 |