Cutoff for permuted Markov chains
From MaRDI portal
Publication:2686612
DOI10.1214/22-AIHP1248MaRDI QIDQ2686612
Publication date: 28 February 2023
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/2104.03568
Related Items
Large scale stochastic dynamics. Abstracts from the workshop held September 11--17, 2022, Accelerating abelian random walks with hyperbolic dynamics
Cites Work
- Unnamed Item
- Cutoff on all Ramanujan graphs
- Total variation cutoff in birth-and-death chains
- A survey of results on random random walks on finite groups
- Cutoff phenomena for random walks on random regular graphs
- On tail probabilities for martingales
- Cutoff at the ``entropic time for sparse Markov chains
- Random walks on the random graph
- Characterization of cutoff for reversible Markov chains
- Cutoff for nonbacktracking random walks on sparse random graphs
- Spectral gap of sparse bistochastic matrices with exchangeable rows
- Speeding up Markov chains with deterministic jumps
- Comparing mixing times on sparse random graphs
- Stein's method for concentration inequalities
- Random walk on sparse random digraphs
- Evolving sets, mixing and heat kernel bounds
- Mixing time of the Chung-Diaconis-Graham random process
- Generating a random permutation with random transpositions
- CUTOFF AT THE ENTROPIC TIME FOR RANDOM WALKS ON COVERED EXPANDER GRAPHS
- Comparison of Cutoffs Between Lazy Walks and Markovian Semigroups