arXiv · 0908.3437
On combinatorial testing problems
Abstract
We study a class of hypothesis testing problems in which, upon observing the realization of an $n$-dimensional Gaussian vector, one has to decide whether the vector was drawn from a standard normal distribution or, alternatively, whether there is a subset of the components belonging to a certain given class of sets whose elements have been ``contaminated,'' that is, have a mean different from zero. We establish some general conditions under which testing is possible and others under which testing is hopeless with a small risk. The combinatorial and geometric structure of the class of sets is shown to play a crucial role. The bounds are illustrated on various examples.
Explore related subjects
Keep this discovery
Louigi Addario-Berry, Nicolas Broutin, Luc Devroye, Gábor Lugosi. 2009-08-24. On combinatorial testing problems. https://doi.org/10.1214/10-aos817
Cite the original work for its findings. Save a collection to share your selection of sources.