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

Geometric probability and stochastic geometry (60D05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Ergodicity, mixing, rates of mixing (37A25)

Abstract: We show that the measure on markings of

m a t h b f Z_{n}^{d}

,

d g e q 3

, with elements of

0, 1

given by i.i.d. fair coin flips on the range

m a t h c a l 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 = 1 / 2 T_{m a t h r m c o v} (m a t h b f Z_{n}^{d})

. As a consequence of our methods, we show that the total variation mixing time of the random walk on the lamplighter graph

m a t h b f Z_{2} w r m a t h b f Z_{n}^{d}

,

d g e q 3

, has a cutoff with threshold

1 / 2 T_{m a t h r m c o v} (m a t h b f Z_{n}^{d})

. 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.

Recommendations

Cites work

Cited in

(16)

This page was built for publication: Uniformity of the uncovered set of random walk and cutoff for lamplighter chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414277)