Searching for a trail of evidence in a maze

Abstract

Consider a graph with a set of vertices and oriented edges connecting pairs of vertices. Each vertex is associated with a random variable and these are assumed to be independent. In this setting, suppose we wish to solve the following hypothesis testing problem: under the null, the random variables have common distribution N(0,1) while under the alternative, there is an unknown path along which random variables have distribution $N(\mu ,1)$, $\mu >0$, and distribution N(0,1) away from it. For which values of the mean shift $\mu$ can one reliably detect and for which values is this impossible? Consider, for example, the usual regular lattice with vertices of the form \[\{(i,j):0\le i,-i\le j\le i and j has the parity of i\}\] and oriented edges $(i,j)\to (i+1,j+s)$, where $s=\pm 1$. We show that for paths of length $m$ starting at the origin, the hypotheses become distinguishable (in a minimax sense) if ${\mu }_m\gg 1/\sqrt{\log m}$, while they are not if ${\mu }_m\ll 1/\log m$. We derive equivalent results in a Bayesian setting where one assumes that all paths are equally likely; there, the asymptotic threshold is ${\mu }_m\approx m^{-1/4}$. We obtain corresponding results for trees (where the threshold is of order 1 and independent of the size of the tree), for distributions other than the Gaussian and for other graphs. The concept of the predictability profile, first introduced by Benjamini, Pemantle and Peres, plays a crucial role in our analysis.

Published in at http://dx.doi.org/10.1214/07-AOS526 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org)

References in corpus (3)

• On testing the significance of sets of genes
• Adaptive multiscale detection of filamentary structures in a background of uniform random points
• Detecting Highly Oscillatory Signals by Chirplet Path Pursuit

Cited by in corpus (13)

• Rigidity and tolerance for perturbed lattices
• Efficient Minimax Signal Detection on Graphs
• Optimal Detection For Sparse Mixtures
• Lattice partition recovery with dyadic CART
• Optimal Detection of Random Walks on Graphs: Performance Analysis via Statistical Physics
• Optimal partition recovery in general graphs
• On a randomized PNG model with a columnar defect
• Asymptotic convergence rate of the longest run in an inflating Bernoulli net
• Fast and Asymptotically Powerful Detection for Filamentary Objects in Digital Images
• Minimax rates for sparse signal detection under correlation
• Sharp Signal Detection Under Ferromagnetic Ising Models
• Clustering Based on Pairwise Distances When the Data is of Mixed Dimensions
• Detecting the trail of a random walker in a random scenery