Abstract: We show that the total-variation mixing time of the lamplighter random walk on fractal graphs exhibit sharp cutoff when the underlying graph is transient (namely of spectral dimension greater than two). In contrast, we show that such cutoff can not occur for strongly recurrent underlying graphs (i.e. of spectral dimension less than two).
Recommendations
- Cut-off for lamplighter chains on tori: dimension interpolation and phase transition
- Uniformity of the uncovered set of random walk and cutoff for lamplighter chains
- Mixing times for random walks on finite lamplighter groups
- Cutoff phenomenon for nearest Lamperti's random walk
- Cutoff for random lifts of weighted graphs
Cites work
- Analysis on fractals
- Brownian Motion and Harmonic Analysis on Sierpinski Carpets
- Characterization of sub‐Gaussian heat kernel estimates on strongly recurrent graphs
- Critical random graphs: Diameter and mixing time
- Cut-off for lamplighter chains on tori: dimension interpolation and phase transition
- Harnack inequalities and sub-Gaussian estimates for random walks
- scientific article; zbMATH DE number 1069282 (Why is no real title available?)
- scientific article; zbMATH DE number 2154239 (Why is no real title available?)
- scientific article; zbMATH DE number 1421099 (Why is no real title available?)
- Lamplighter random walks on fractals
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Mixing time bounds via the spectral profile
- Mixing times for random walks on finite lamplighter groups
- Moduli of continuity of local times of random walks on graphs in terms of the resistance metric
- On the equivalence of parabolic Harnack inequalities and heat kernel estimates
- Random walks and heat kernels on graphs
- Random walks on graphs with regular volume growth
- Stability of parabolic Harnack inequalities
- Stability of the elliptic Harnack inequality
- Sub-Gaussian estimates of heat kernels on infinite graphs
- The art of random walks.
- Uniformity of the late points of random walk on \({\mathbb {Z}}_{n}^{d}\) for \(d \geq 3\)
- Uniformity of the uncovered set of random walk and cutoff for lamplighter chains
Cited in
(5)- Cut-off for lamplighter chains on tori: dimension interpolation and phase transition
- Lamplighter random walks on fractals
- Cutoff phenomenon for nearest Lamperti's random walk
- Uniform mixing time for random walk on lamplighter graphs
- Mixing of the averaging process and its discrete dual on finite-dimensional geometries
This page was built for publication: Cutoff for lamplighter chains on fractals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1663904)
