Uniform mixing time for random walk on lamplighter graphs

DOI10.1214/13-AIHP547zbMath1318.60053arXiv1109.4281OpenAlexW3105367601MaRDI QIDQ479701

Jason Miller, Yuval Peres, Júlia Komjáthy

Publication date: 5 December 2014

Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.4281

zbMATH Keywords

random walksmixing timelamplighter graphs

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Ergodicity, mixing, rates of mixing (37A25) Local time and additive functionals (60J55) Random walks on graphs (05C81)

Related Items (2)

Upgrading MLSI to LSI for reversible Markov chains ⋮ Cut-off for lamplighter chains on tori: dimension interpolation and phase transition

Cites Work

• Uniformity of the uncovered set of random walk and cutoff for lamplighter chains
• Comparison techniques for random walk on finite groups
• Rates of convergence for lamplighter processes
• Mixing times for random walks on finite lamplighter groups
• Cover times for Brownian motion and random walks in two dimensions
• Optimal Hoeffding bounds for discrete reversible Markov chains.
• Late points for random walks in two dimensions
• Logarithmic Sobolev inequalities for finite Markov chains
• Random Walk: A Modern Introduction

This page was built for publication: Uniform mixing time for random walk on lamplighter graphs