On combinatorial testing problems

Annals of Statistics

Volumn 38, Issue 5, 2010, Pages 3063-3092

  Addario Berry, Louigi ^a   Broutin, Nicolas ^b   Devroye, Luc ^a   Lugosi, Gábor ^c  

^a MCGILL UNIVERSITY   (Canada)

^b INRIA ROCQUENCOURT   (France)

^c UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

Gaussian processes.; Hypothesis testing; Multiple hypotheses

Indexed keywords

EID: 77957596976     PISSN: 00905364     EISSN: None     Source Type: Journal    
DOI: 10.1214/10-AOS817     Document Type: Article

References (36)

1. ALDOUS, D. J. (1990). The random walk construction of uniform spanning trees and uniform labelled trees. SIAM J. Discrete Math. 3 450-465. MR1069105
2. ALON, N., KRIVELEVICH, M. and SUDAKOV, B. (1999). Finding a large hidden clique in a random graph. Randoms Structures Algorithms 13 457-466. MR1662795
3. ARIAS-CASTRO, E., CANDÈS, E. J., HELGASON, H. and ZEITOUNI, O. (2008). Searching for a trail of evidence in a maze. Ann. Statist. 36 1726-1757. MR2435454
4. ARIAS-CASTRO, E., CANDÈS, E. and DURAND, A. (2009). Detection of abnormal clusters in a network. Technical report, Univ. California, San Diego.
5. ARLOT, S., BLANCHARD, G. and ROQUAIN, E. (2010a). Some nonasymptotic results on resampling in high dimension, I: Confidence regions. Ann. Statist. 38 51-82. MR2589316
6. ARLOT, S., BLANCHARD, G. and ROQUAIN, E. (2010b). Some nonasymptotic results on resampling in high dimension. II. Multiple tests. Ann. Statist. 38 83-99. MR2589317
7. BARAUD, Y. (2002). Non-asymptotic minimax rates of testing in signal detection. Bernoulli 8 577-606. MR1935648
8. BENJAMINI, I., LYONS, R., PERES, Y. and SCHRAMM, O. (2001). Uniform spanning forests. Ann. Probab. 29 1-65. MR1825141
9. BHATTACHARYYA, A. (1946). On a measure of divergence between two multinomial populations. Sankhyā7 401-406. MR0018387
10. BOUCHERON, S., LUGOSI, G. and MASSART, P. (2000). A sharp concentration inequality with applications. Random Structures Algorithms 16 277-292. MR1749290
11. BRODER, A. (1989). Generating random spanning trees. In 30th Annual Symposium on Foundations of Computer Science 442-447. IEEE Press, Research Triangle Park, NC.
12. DEVROYE, L. and GYÖRFI, L. (1985). Nonparametric Density Estimation: The L1 View. Wiley, New York. MR0780746
13. DEVROYE, L., GYÖRFI, L. and LUGOSI, G. (1996). A Probabilistic Theory of Pattern Recognition. Springer, New York. MR1383093
14. DONOHO, D. and JIN, J. (2004). Higher criticism for detecting sparse heterogeneous mixtures. Ann. Statist. 32 962-994. MR2065195
15. DUBDASHI, D. and RANJAN, D. (1998). Balls and bins: A study in negative dependence. Random Structures Algorithms 13 99-124. MR1642566
16. DUDLEY, R. M. (1978). Central limit theorems for empirical measures. Ann. Probab. 6 899-929. MR0512411
17. DUROT, C. and ROZENHOLC, Y. (2006). An adaptive test for zero mean. Math. Methods Statist. 15 26-60. MR2225429
18. FEDER, T. and MIHAIL, M. (1992). Balanced matroids. In STOC'92: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing 26-38. ACM, New York.
19. FEIGE, U. and KRAUTHGAMER, R. (2000). Finding and certifying a large hidden clique in a semirandom graph. Random Structures Algorithms 16 195-208. MR1742351
20. GLAZ, J., NAUS, J. and WALLENSTEIN, S. (2001). Scan Statistics. Springer, New York. MR1869112
21. GRIMMETT, G. R. andWINKLER, S. N. (2004). Negative association in uniform forests and connected graphs. Random Structures Algorithms 24 444-460. MR2060630
22. HAUSSLER, D. (1995). Sphere packing numbers for subsets of the boolean n-cube with bounded Vapnik-Chervonenkis dimension. J. Combin. Theory Ser. A 69 217-232. MR1313896
23. HOEFFDING, W. (1963). Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc. 58 13-30. MR0144363
24. INGSTER, Y. I. (1999).Minimax detection of a signal for lnp -balls. Math. Methods Statist. 7 401-428. MR1680087
25. JERRUM, M., SINCLAIR, A. and VIGODA, E. (2004). A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. J. ACM 51 671-697. MR2147852
26. LE CAM, L. (1970). On the assumptions used to prove asymptotic normality of maximum likelihood estimates. Ann. Math. Statist. 41 802-828. MR0267676
27. LEDOUX, M. and TALAGRAND, M. (1991). Probability in Banach Spaces. Springer, New York. MR1102015
28. MOON, J. W. (1970). Counting Labelled Trees. Canadian Mathematical Monographs 1. Canadian Mathematical Congress, Montreal. MR0274333
29. PROPP, J. G. and WILSON, D. B. (1998). How to get a perfectly random sample from a generic Markov chain and generate a random spanning tree of a directed graph. J. Algorithms 27 170-217. MR1622393
30. ROMANO, J. P. andWOLF, M. (2005). Exact and approximate stepdown methods for multiple hypothesis testing. J. Amer. Statist. Assoc. 100 94-108. MR2156821
31. SHABALIN, A. A., WEIGMAN, V. J., PEROU, C. M. and NOBEL, A. B. (2009). Finding large average submatrices in high dimensional data. Ann. Appl. Statist. 3 985-1012.
32. SLEPIAN, D. (1962). The one-sided barrier problem for Gaussian noise. Bell System Tech. J. 41 463-501. MR0133183
33. TALAGRAND, M. (2005). The Generic Chaining. Springer, New York. MR2133757
34. TSIRELSON, B. S., IBRAGIMOV, I. A. and SUDAKOV, V. N. (1976). Norm of Gaussian sample function. In Proceedings of the 3rd Japan-U.S.S.R. Symposium on Probability Theory. Lecture Notes in Math. 550 20-41. Springer, Berlin. MR0458556
35. VAPNIK, V. N. and CHERVONENKIS, A. Y. (1971). On the uniform convergence of relative frequences of events to their probabilities. Theory Probab. Appl. 16 264-280.
36. VONNEGUT, K. (1973). Breakfast of Champions. Delacorte Press, New York.