Open Access
2004 Mixing Times for Random Walks on Finite Lamplighter Groups
Yuval Peres, David Revelle
Author Affiliations +
Electron. J. Probab. 9: 825-845 (2004). DOI: 10.1214/EJP.v9-198

Abstract

Given a finite graph $G$, a vertex of the lamplighter graph $G^\diamondsuit=\mathbb {Z}_2 \wr G$ consists of a zero-one labeling of the vertices of $G$, and a marked vertex of $G$. For transitive $G$ we show that, up to constants, the relaxation time for simple random walk in $G^\diamondsuit$ is the maximal hitting time for simple random walk in $G$, while the mixing time in total variation on $G^\diamondsuit$ is the expected cover time on $G$. The mixing time in the uniform metric on $G^\diamondsuit$ admits a sharp threshold, and equals $|G|$ multiplied by the relaxation time on $G$, up to a factor of $\log |G|$. For $\mathbb {Z}_2 \wr \mathbb {Z}_n^2$, the lamplighter group over the discrete two dimensional torus, the relaxation time is of order $n^2 \log n$, the total variation mixing time is of order $n^2 \log^2 n$, and the uniform mixing time is of order $n^4$. For $\mathbb {Z}_2 \wr \mathbb {Z}_n^d$ when $d\geq 3$, the relaxation time is of order $n^d$, the total variation mixing time is of order $n^d \log n$, and the uniform mixing time is of order $n^{d+2}$. In particular, these three quantities are of different orders of magnitude.

Citation

Download Citation

Yuval Peres. David Revelle. "Mixing Times for Random Walks on Finite Lamplighter Groups." Electron. J. Probab. 9 825 - 845, 2004. https://doi.org/10.1214/EJP.v9-198

Information

Accepted: 23 August 2004; Published: 2004
First available in Project Euclid: 6 June 2016

zbMATH: 1064.60095
MathSciNet: MR2110019
Digital Object Identifier: 10.1214/EJP.v9-198

Subjects:
Primary: 60J10
Secondary: 60B15

Keywords: Cover time , lamplighter group , mixing time , Random walks

Vol.9 • 2004
Back to Top