Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article
Public Access

The Cost of Uncertainty in Curing Epidemics

Published: 13 June 2018 Publication History

Abstract

Motivated by the study of controlling (curing) epidemics, we consider the spread of an SI process on a known graph, where we have a limited budget to use to transition infected nodes back to the susceptible state (i.e., to cure nodes). Recent work has demonstrated that under perfect and instantaneous information (which nodes are/are not infected), the budget required for curing a graph precisely depends on a combinatorial property called the CutWidth. We show that this assumption is in fact necessary: even a minor degradation of perfect information, e.g., a diagnostic test that is 99% accurate, drastically alters the landscape. Infections that could previously be cured in sublinear time now may require exponential time, or orderwise larger budget to cure. The crux of the issue comes down to a tension not present in the full information case: if a node is suspected (but not certain) to be infected, do we risk wasting our budget to try to cure an uninfected node, or increase our certainty by longer observation, at the risk that the infection spreads further? Our results present fundamental, algorithm-independent bounds that tradeoff budget required vs. uncertainty.

References

[1]
Ery Arias-castro, Emmanuel J Candès, and Arnaud Durand. 2011. Detection of an anomalous cluster in a network. 39, 1 (2011), 278--304. arXiv:arXiv:1001.3209v2
[2]
Ery Arias-Castro, Emmanuel J. Candès, Hannes Helgason, and Ofer Zeitouni. 2008. Searching for a trail of evidence in a maze. Annals of Statistics 36, 4 (2008), 1726--1757. arXiv:math/0701668
[3]
Ery Arias-castro and S T Nov. {n. d.}. Detecting a Path of Correlations in a Network. ({n. d.}), 1--12. arXiv:arXiv:1511.01009v1
[4]
Daniel Bernoulli and Sally Blower. 2004. An attempt at a new analysis of the mortality caused by smallpox and of the advantages of inoculation to prevent it. Reviews in medical virology 14 (2004), 275--288.
[5]
Abhijit Bose, Xin Hu, Kang G. Shin, and Taejoon Park. 2008. Behavioral Detection of Malware on Mobile Handsets. In Proceedings of the 6th International Conference on Mobile Systems, Applications, and Services (MobiSys '08). ACM, New York, NY, USA, 225--238.
[6]
Daniel G Brown. {n. d.}. How I wasted too long finding a concentration inequality for sums of geometric variables. Found at https://cs. uwaterloo. ca/? browndg/negbin. pdf 6 ({n. d.}).
[7]
Thomas M Cover and Joy A Thomas. 2012. Elements of information theory. John Wiley & Sons.
[8]
Kimon Drakopoulos, Asuman Ozdaglar, and John N. Tsitsiklis. 2014. An efficient curing policy for epidemics on graphs. arXiv preprint arXiv:1407.2241 December (2014), 1--10. arXiv:arXiv:1407.2241v1
[9]
Kimon Drakopoulos, Asuman Ozdaglar, and John N. Tsitsiklis. 2015. A lower bound on the performance of dynamic curing policies for epidemics on graphs. 978 (2015), 3560--3567. arXiv:1510.06055
[10]
Kimon Drakopoulos, Asuman Ozdaglar, and John N. Tsitsiklis. 2015. When is a network epidemic hard to eliminate? (2015), 1--17. arXiv:1510.06054 http://arxiv.org/abs/1510.06054
[11]
Giulia Fanti, Peter Kairouz, Sewoong Oh, Kannan Ramchandran, and Pramod Viswanath. 2016. Rumor source obfuscation on irregular trees. In Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science. ACM, 153--164.
[12]
Giulia Fanti, Peter Kairouz, Sewoong Oh, and Pramod Viswanath. 2015. Spy vs. spy: Rumor source obfuscation. In ACM SIGMETRICS Performance Evaluation Review, Vol. 43. ACM, 271--284.
[13]
Robert Gallager. 2013. Stochastic Processes: 9 - Random Walks, Large Deviations, and Martingales. Stochastic Processes (2013).
[14]
Ayalvadi Ganesh, Laurent Massoulié, and Don Towsley. 2005. The effect of network topology on the spread of epidemics. In INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, Vol. 2. IEEE, 1455--1466.
[15]
David Grimmett, Geoffrey Stirzaker. 2001. Probability and random processes. Oxford university press.
[16]
Grégoire Jacob, Hervé Debar, and Eric Filiol. 2008. Behavioral detection of malware: from a survey towards an established taxonomy. Journal in Computer Virology 4, 3 (2008), 251--266.
[17]
Yishay Mansour. 2011. Lecture 5 : Lower Bounds using Information Theory Tools Distance between Distributions KL-Divergence. (2011).
[18]
Eli A Meirom, Chris Milling, Constantine Caramanis, Shie Mannor, Sanjay Shakkottai, and Ariel Orda. 2015. Localized epidemic detection in networks with overwhelming noise. In ACM SIGMETRICS Performance Evaluation Review, Vol. 43. ACM, 441--442.
[19]
Chris Milling, Constantine Caramanis, Shie Mannor, and Sanjay Shakkottai. 2015. Distinguishing Infections on Different Graph Topologies. IEEE Transactions on Information Theory 61, 6 (2015), 3100--3120. arXiv:1309.6545
[20]
Chris Milling, Constantine Caramanis, Shie Mannor, and Sanjay Shakkottai. 2015. Local detection of infections in heterogeneous networks. Proceedings - IEEE INFOCOM 26 (2015), 1517--1525.
[21]
Mark E. J. Newman. 2002. Spread of epidemic disease on networks. Physical Review E - Statistical, Nonlinear, and Soft Matter Physics 66, 1 (2002). arXiv:cond-mat/0205009
[22]
Ivan N. Sanov. 1961. On the Probability of Large Deviations of Random Variables. (1961), 213--224 pages.
[23]
Devavrat Shah and Tauhid Zaman. 2010. Detecting sources of computer viruses in networks: theory and experiment. In ACM SIGMETRICS Performance Evaluation Review, Vol. 38. ACM, 203--214.
[24]
Devavrat Shah and Tauhid Zaman. 2011. Rumors in a network: Who's the culprit? IEEE Transactions on information theory 57, 8 (2011), 5163--5181.
[25]
Devavrat Shah and Tauhid Zaman. 2012. Rumor centrality: a universal source detector. In ACM SIGMETRICS Performance Evaluation Review, Vol. 40. ACM, 199--210.
[26]
James Sharpnack, Alessandro Rinaldo, and Aarti Singh. 2012. Changepoint detection over graphs with the spectral scan statistic. arXiv preprint 31 (2012), 1--14. arXiv:arXiv:1206.0773v1 http://arxiv.org/abs/1206.0773
[27]
Sam Spencer and R Srikant. 2015. On the impossibility of localizing multiple rumor sources in a line graph. ACM SIGMETRICS Performance Evaluation Review 43, 2 (2015), 66--68.
[28]
Zhaoxu Wang, Wenxiang Dong, Wenyi Zhang, and Chee Wei Tan. 2014. Rumor source detection with multiple observations: Fundamental limits and algorithms. In ACM SIGMETRICS Performance Evaluation Review, Vol. 42. ACM, 1--13.

Cited By

View all
  • (2021)Active Screening for Recurrent Diseases: A Reinforcement Learning ApproachProceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3463952.3464068(992-1000)Online publication date: 3-May-2021
  • (2021)Agent-Based Markov Modeling for Improved COVID-19 Mitigation PoliciesJournal of Artificial Intelligence Research10.1613/jair.1.1263271(953-992)Online publication date: 10-Sep-2021
  • (2020)Who and When to ScreenProceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3398761.3398877(992-1000)Online publication date: 5-May-2020

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Proceedings of the ACM on Measurement and Analysis of Computing Systems
Proceedings of the ACM on Measurement and Analysis of Computing Systems  Volume 2, Issue 2
June 2018
370 pages
EISSN:2476-1249
DOI:10.1145/3232754
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 June 2018
Published in POMACS Volume 2, Issue 2

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. contact process on graph
  2. contagion
  3. controlled si model
  4. partial information
  5. time to extinction

Qualifiers

  • Research-article

Funding Sources

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)45
  • Downloads (Last 6 weeks)14
Reflects downloads up to 23 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2021)Active Screening for Recurrent Diseases: A Reinforcement Learning ApproachProceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3463952.3464068(992-1000)Online publication date: 3-May-2021
  • (2021)Agent-Based Markov Modeling for Improved COVID-19 Mitigation PoliciesJournal of Artificial Intelligence Research10.1613/jair.1.1263271(953-992)Online publication date: 10-Sep-2021
  • (2020)Who and When to ScreenProceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3398761.3398877(992-1000)Online publication date: 5-May-2020

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media