Detection of an anomalous cluster in a network
Ery Arias-Castro, Emmanuel J. Cand\`es, Arnaud Durand

TL;DR
This paper studies detecting unusual clusters in sensor networks, providing theoretical bounds and showing that scan statistics are nearly optimal for identifying such anomalies in static and surveillance settings.
Contribution
It establishes minimax detection bounds for anomalous clusters and demonstrates the near-optimality of scan statistics across general models including exponential families.
Findings
Scan statistics achieve near-minimax detection rates.
Detection bounds are established for large clusters.
Results extend to exponential family models.
Abstract
We consider the problem of detecting whether or not, in a given sensor network, there is a cluster of sensors which exhibit an "unusual behavior." Formally, suppose we are given a set of nodes and attach a random variable to each node. We observe a realization of this process and want to decide between the following two hypotheses: under the null, the variables are i.i.d. standard normal; under the alternative, there is a cluster of variables that are i.i.d. normal with positive mean and unit variance, while the rest are i.i.d. standard normal. We also address surveillance settings where each sensor in the network collects information over time. The resulting model is similar, now with a time series attached to each node. We again observe the process over time and want to decide between the null, where all the variables are i.i.d. standard normal, and the alternative, where there is an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
