On combinatorial testing problems

DOI10.1214/10-AOS817zbMath1200.62059arXiv0908.3437OpenAlexW2166043450WikidataQ104514359 ScholiaQ104514359MaRDI QIDQ605939

Louigi Addario-Berry, Nicolas Broutin, Luc P. Devroye, Gábor Lugosi

Publication date: 15 November 2010

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0908.3437

zbMATH Keywords

Gaussian processeshypothesis testingmultiple hypotheses

Mathematics Subject Classification ID

Parametric hypothesis testing (62F03) Hypothesis testing in multivariate analysis (62H15) Applications of graph theory (05C90) Inference from stochastic processes (62M99) Asymptotic properties of parametric tests (62F05)

Related Items (33)

Energy landscape for large average submatrix detection problems in Gaussian random matrices ⋮ NetMix: A Network-Structured Mixture Model for Reduced-Bias Estimation of Altered Subnetworks ⋮ Hypothesis testing for high-dimensional multinomials: a selective review ⋮ Detection thresholds for the \(\beta\)-model on sparse graphs ⋮ NetMix2: unifying network propagation and altered subnetworks ⋮ Optimal detection of sparse principal components in high dimension ⋮ Optimal change point detection in Gaussian processes ⋮ Comment on: \(\ell _{1}\)-penalization for mixture regression models ⋮ Nonparametric detection for univariate and functional data ⋮ Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time ⋮ Unnamed Item ⋮ Detecting structured signals in Ising models ⋮ Some superconcentration inequalities for extrema of stationary Gaussian processes ⋮ Detection of an anomalous cluster in a network ⋮ Detection of a sparse submatrix of a high-dimensional noisy matrix ⋮ Detection of correlations ⋮ Adaptive sensing performance lower bounds for sparse signal detection and support estimation ⋮ Combinatorial inference for graphical models ⋮ Comment on ``Hypothesis testing by convex optimization ⋮ Are there needles in a moving haystack? Adaptive sensing for detection of dynamically evolving signals ⋮ Approximate \(\ell_0\)-penalized estimation of piecewise-constant signals on graphs ⋮ Detecting Markov random fields hidden in white noise ⋮ Optimal testing for planted satisfiability problems ⋮ Non-asymptotic detection of two-component mixtures with unknown means ⋮ Global testing against sparse alternatives under Ising models ⋮ Distribution-Free Detection of Structured Anomalies: Permutation and Rank-Based Scans ⋮ Hypothesis testing for densities and high-dimensional multinomials: sharp local minimax rates ⋮ High-dimensional change-point detection under sparse alternatives ⋮ Detecting a Path of Correlations in a Network ⋮ Property testing in high-dimensional Ising models ⋮ Detecting positive correlations in a multivariate sample ⋮ Computational barriers in minimax submatrix detection ⋮ Higher criticism for large-scale inference, especially for rare and weak effects

Uses Software

• LAS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some nonasymptotic results on resampling in high dimension. I: Confidence regions
• Searching for a trail of evidence in a maze
• Finding large average submatrices in high dimensional data
• Central limit theorems for empirical measures
• Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
• Minimax detection of a signal for \(l^ n\)-balls.
• Non-asymptotic minimax rates of testing in signal detection
• Uniform spanning forests
• Higher criticism for detecting sparse heterogeneous mixtures.
• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
• How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
• A sharp concentration inequality with applications
• The Generic Chaining
• Balls and bins: A study in negative dependence
• Negative association in uniform forests and connected graphs
• Finding and certifying a large hidden clique in a semirandom graph
• Probability Inequalities for Sums of Bounded Random Variables
• On the Assumptions Used to Prove Asymptotic Normality of Maximum Likelihood Estimates
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Exact and Approximate Stepdown Methods for Multiple Hypothesis Testing
• Scan statistics

This page was built for publication: On combinatorial testing problems