Uniformity of the uncovered set of random walk and cutoff for lamplighter chains
arXiv:0912.5523 · doi:10.1214/10-AOP624
Abstract
We show that the measure on markings of , , with elements of given by i.i.d. fair coin flips on the range of a random walk run until time and 0 otherwise becomes indistinguishable from the uniform measure on such markings at the threshold . As a consequence of our methods, we show that the total variation mixing time of the random walk on the lamplighter graph , , has a cutoff with threshold . We give a general criterion under which both of these results hold; other examples for which this applies include bounded degree expander families, the intersection of an infinite supercritical percolation cluster with an increasing family of balls, the hypercube and the Caley graph of the symmetric group generated by transpositions. The proof also yields precise asymptotics for the decay of correlation in the uncovered set.
Published in at http://dx.doi.org/10.1214/10-AOP624 the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org)
References in corpus (2)
Cited by in corpus (11)
- Asymptotics of cover times via Gaussian free fields: Bounded-degree graphs and general trees
- Cover levels and random interlacements
- Painting a graph with competing random walks
- Mixing and relaxation time for Random Walk on Wreath Product Graphs
- Uniform mixing time for Random Walk on Lamplighter Graphs
- On binomial sums, additive energies, and lazy random walks
- Bounds for left and right window cutoffs
- A spectral characterization for concentration of the cover time
- Multi-target search in bounded and heterogeneous environments: a lattice random walk perspective
- Cutoff for the Swendsen-Wang dynamics on the lattice
- Information Percolation and Cutoff for the Random-Cluster Model