A comparison principle for random walk on dynamical percolation
From MaRDI portal
Publication:2212614
DOI10.1214/20-AOP1441zbMath1456.60256arXiv1902.02770OpenAlexW3093556971MaRDI QIDQ2212614
Publication date: 24 November 2020
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.02770
Central limit and other weak theorems (60F05) Sums of independent random variables; random walks (60G50) Interacting random processes; statistical mechanics type models; percolation theory (60K35)
Related Items
Random Walks on Randomly Evolving Graphs ⋮ Multiple random walks on graphs: mixing few to cover many ⋮ An invariance principle for one-dimensional random walks in degenerate dynamical random environments ⋮ Collisions of random walks in dynamic random environments ⋮ Linking the mixing times of random walks on static and dynamic random graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Cover times, blanket times, and majorizing measures
- Random walks on dynamical percolation: mixing times, mean squared displacement and hitting times
- Hypercube percolation
- Sensitivity of mixing times
- Mixing time bounds via the spectral profile
- Nilprogressions and groups with moderate growth
- Moderate growth and random walk on finite groups
- Dynamical percolation
- Mixing times of random walks on dynamic configuration models
- On sensitivity of uniform mixing times
- Limit theory for random walks in degenerate time-dependent random environments
- On sensitivity of mixing times and cutoff
- Characterization of cutoff for reversible Markov chains
- Mixing time for random walk on supercritical dynamical percolation
- A characterization of \(L_{2}\) mixing and hypercontractivity via hitting times and maximal inequalities
- A Dirichlet principle for non reversible Markov chains and some recurrence theorems
- Logarithmic Sobolev inequalities for finite Markov chains
- Evolving sets, mixing and heat kernel bounds
- On the precision of the spectral profile
- Some Inequalities for Reversible Markov Chains
- A technical report on hitting times, mixing and cutoff
- Quenched exit times for random walk on dynamical percolation
- Sharp Bounds on Random Walk Eigenvalues via Spectral Embedding