Uniformity of the uncovered set of random walk and cutoff for lamplighter chains

We show that the measure on markings of Znd, d ≥ 3, with elements of {0, 1} given by i.i.d. fair coin flips on the range $\mathcal{R}$ of a random walk X run until time T and 0 otherwise becomes indistinguishable from the uniform measure on such markings at the threshold T = ½Tcov(Znd). As a consequence of our methods, we show that the total variation mixing time of the random walk on the lamplighter graph Z2 ≀ Znd, d ≥ 3, has a cutoff with threshold ½Tcov(Znd). 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.

[1]  V. Climenhaga Markov chains and mixing times , 2013 .

[2]  Parkpoom Phetpradap,et al.  Intersections of random walks , 2011 .

[3]  David Revelle,et al.  Mixing Times for Random Walks on Finite Lamplighter Groups , 2004, math/0404190.

[4]  A. Dembo,et al.  Brownian Motion on Compact Manifolds: Cover Time and Late Points , 2003 .

[5]  A. Dembo,et al.  Late points for random walks in two dimensions , 2003, math/0303102.

[6]  M. Barlow Random walks on supercritical percolation clusters , 2003, math/0302004.

[7]  A. Dembo,et al.  Thick points for planar Brownian motion and the Erdős-Taylor conjecture on random walk , 2001 .

[8]  A. Dembo,et al.  Cover times for Brownian motion and random walks in two dimensions , 2001, math/0107191.

[9]  Elchanan Mossel,et al.  On the mixing time of a simple random walk on the super critical percolation cluster , 2000, math/0011092.

[10]  Thierry Delmotte,et al.  Parabolic Harnack inequality and estimates of Markov chains on graphs , 1999 .

[11]  J. Pitman,et al.  Kac's moment formula and the Feynman-Kac formula for additive functionals of a Markov process , 1999 .

[12]  Amir Dembo,et al.  Large Deviations Techniques and Applications , 1998 .

[13]  Johan Jonasson,et al.  Rates of convergence for lamplighter processes , 1997 .

[14]  Ãgoston Pisztora,et al.  Surface order large deviations for Ising, Potts and percolation models , 1996 .

[15]  J. Deuschel,et al.  Surface order large deviations for high-density percolation , 1996 .

[16]  H. Hilhorst,et al.  Covering of a finite lattice by a random walk , 1991 .

[17]  D. Aldous Threshold limits for cover times , 1991 .

[18]  Ronald L. Graham,et al.  Asymptotic Analysis of a Random Walk on a Hypercube with Many Dimensions , 1990, Random Struct. Algorithms.

[19]  P. Matthews Covering Problems for Markov Chains , 1988 .

[20]  Andrei Z. Broder,et al.  On the second eigenvalue of random regular graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[21]  P. Diaconis,et al.  SHUFFLING CARDS AND STOPPING-TIMES , 1986 .

[22]  D. Aldous Random walks on finite groups and rapidly mixing markov chains , 1983 .

[23]  P. Diaconis,et al.  Generating a random permutation with random transpositions , 1981 .

[24]  J. Doob Stochastic processes , 1953 .