Work

A Tight Bound for the Lamplighter Problem

Year: 2006
Type: preprint
Abstract: We settle an open problem, raised by Y. Peres and D. Revelle, concerning the $L^2$ mixing time of the random walk on the lamplighter graph. We also provide general bounds relating the entropy decay of a Markov chain to the separation distance of the chain, and show that the lamplighter graphs once again provide examples of tightness of our results.
Language: English
Open Access status: green
OpenAlex ID: W9648971
Cites: 10
Cited by: 2
Related to: 10