Detection of correlations
From MaRDI portal
Publication:450041
Abstract: We consider the hypothesis testing problem of deciding whether an observed high-dimensional vector has independent normal components or, alternatively, if it has a small subset of correlated components. The correlated components may have a certain combinatorial structure known to the statistician. We establish upper and lower bounds for the worst-case (minimax) risk in terms of the size of the correlated subset, the level of correlation, and the structure of the class of possibly correlated sets. We show that some simple tests have near-optimal performance in many cases, while the generalized likelihood ratio test is suboptimal in some important cases.
Recommendations
- scientific article; zbMATH DE number 1495742
- Extracting correlations
- Detecting positive correlations in a multivariate sample
- Detecting a path of correlations in a network
- scientific article; zbMATH DE number 1551916
- Correlation and dependence
- Correlation measures
- Detection of Correlations With Adaptive Sensing
Cites work
- scientific article; zbMATH DE number 3172233 (Why is no real title available?)
- Covariance regularization by thresholding
- Detection of Gauss–Markov Random Fields With Nearest-Neighbor Dependency
- Detection of Spatially Correlated Gaussian Time Series
- Detection of an anomalous cluster in a network
- Detection of stochastic processes
- False Discovery Control for Random Fields
- High-dimensional random geometric graphs and their clique number
- Higher criticism for detecting sparse heterogeneous mixtures.
- Innovated higher criticism for detecting sparse signals in correlated noise
- Maximal meaningful events and applications to image analysis
- Minimax detection of a signal for \(l^ n\)-balls.
- Near-Optimal Detection of Geometric Objects by Fast Multiscale Methods
- Non-asymptotic minimax rates of testing in signal detection
- On combinatorial testing problems
- On the asymptotic distribution of the discrete scan statistic
- Optimal detection of heterogeneous and heteroscedastic mixtures
- Optimal rates of convergence for covariance matrix estimation
- Searching for a trail of evidence in a maze
- Testing Statistical Hypotheses
Cited in
(20)- Fast nonasymptotic testing and support recovery for large sparse Toeplitz covariance matrices
- Combinatorial inference for graphical models
- Tests alternative to higher criticism for high-dimensional means under sparsity and column-wise dependence
- Detecting a path of correlations in a network
- Joint sequential detection and isolation for dependent data streams
- Some permutation symmetric multiple hypotheses testing rules under dependent setup
- Detecting Markov random fields hidden in white noise
- Detecting positive correlations in a multivariate sample
- Sequential subspace change point detection
- Statistical and computational limits for sparse matrix detection
- Sharp optimality for high-dimensional covariance testing under sparse signals
- Optimal detection of sparse principal components in high dimension
- Optimal testing for planted satisfiability problems
- Innovated higher criticism for detecting sparse signals in correlated noise
- Property testing in high-dimensional Ising models
- Testing and signal identification for two-sample high-dimensional covariances via multi-level thresholding
- Indirect determination of correlation
- scientific article; zbMATH DE number 2080965 (Why is no real title available?)
- Optimality and sub-optimality of PCA. I: Spiked random matrix models
- Direct evaluation of the desired correlations: verification on real data
This page was built for publication: Detection of correlations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q450041)
