Eli A. Meirom
Abstract
We consider the problem of detecting an epidemic in a population where individual diagnoses are extremely noisy. We show that exclusively local, approximate knowledge of the contact network suffices to accurately detect the epidemic. The motivation for this problem is the plethora of examples (influenza strains in humans, or computer viruses in smartphones, etc.) where reliable diagnoses are scarce, but noisy data plentiful. In flu or phone-viruses, exceedingly few infected people/phones are professionally diagnosed (only a small fraction go to a doctor) but less reliable secondary signatures (e.g., people staying home, or greater-than-typical upload activity) are more readily available.
Our algorithm requires only local-neighbor knowledge of this graph, and in a broad array of settings that we describe, succeeds even when false negatives and false positives make up an overwhelming majority of the data available. Our results show it succeeds in the presence of partial information about the contact network, and also when are many (hundreds, in our examples) of initial patients-zero.
- C. Milling, C. Caramanis, S. Mannor, and S. Shakkottai, "Network forensics," in SIGMETRICS '12, vol. 40, no. 1, Jun. 2012, p. 223. Google Scholar
Digital Library
- E. A. Meirom, C. Milling, C. Caramanis, S. Mannor, A. Orda, and S. Shakkottai, "Localized epidemic detection in networks with overwhelming noise." {Online}. Available: http://arxiv.org/abs/1402.1263Google Scholar
Index Terms
- Localized Epidemic Detection in Networks with Overwhelming Noise
Recommendations
Localized Epidemic Detection in Networks with Overwhelming Noise
SIGMETRICS '15: Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer SystemsWe consider the problem of detecting an epidemic in a population where individual diagnoses are extremely noisy. We show that exclusively local, approximate knowledge of the contact network suffices to accurately detect the epidemic. The motivation for ...
Using epidemic betweenness to measure the influence of users in complex networks
Betweenness is a measure of the centrality of a node in a network, and is normally calculated as the fraction of shortest paths, random walk paths or flow units between node pairs that pass through the node of interest. Betweenness is, in some sense, a ...
Blogs: spinning a web of virality
iConference '11: Proceedings of the 2011 iConferenceThe aim of this study is to understand the role of bloggers in driving viral information. More specifically, we develop a new methodology that creates a map of the 'life cycle' of blogs posting links to viral information. Our dataset focuses blogs ...
Comments