Detecting a path of correlations in a network
From MaRDI portal
Random matrices (probabilistic aspects) (60B20) White noise theory (60H40) Minimax procedures in statistical decision theory (62C20) Nonparametric hypothesis testing (62G10) Hypothesis testing in multivariate analysis (62H15) Measures of association (correlation, canonical correlation, etc.) (62H20)
Abstract: We consider the problem of detecting an anomaly in the form of a path of correlations hidden in white noise. We provide a minimax lower bound and a test that, under mild assumptions, is able to achieve the lower bound up to a multiplicative constant.
Recommendations
Cites work
- Adaptive multiscale detection of filamentary structures in a background of uniform random points
- Cluster detection in networks using percolation
- Detecting Markov random fields hidden in white noise
- Detecting positive correlations in a multivariate sample
- Detection of an anomalous cluster in a network
- Detection of correlations
- Honey-pot constrained searching with local sensory information
- scientific article; zbMATH DE number 783366 (Why is no real title available?)
- Maximal meaningful events and applications to image analysis
- Near-Optimal Detection of Geometric Objects by Fast Multiscale Methods
- On combinatorial testing problems
- Optimal and fast detection of spatial clusters with scan statistics
- Searching for a trail of evidence in a maze
- Unpredictable paths and percolation
Cited in
(4)
This page was built for publication: Detecting a path of correlations in a network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2954468)