Limit profiles for projections of random walks on groups
Open Access
- 1 January 2024
- journal article
- research article
- Published by Institute of Mathematical Statistics in Electronic Journal of Probability
- Vol. 29 (none) , 1-22
Abstract
Establishing cutoff—an abrupt transition from ‘not mixed’ to ‘well mixed’—is a classical topic in the theory of mixing times for Markov chains. Interest has grown recently in determining not only the existence of cutoff and the order of its mixing time and window, but the exact shape, or profile, of the convergence inside the window. Classical techniques, such as coupling or ℓ2-bounds, are typically too crude to establish this and there has been a push to develop general techniques [27, 21, 20]. We build upon this work, extending from conjugacy-invariant random walks on groups to certain projections. We exemplify our method by analysing the k-particle interchange process on the complete n-graph with k≍n. This is a projection of the random-transposition card shuffle, which corresponds to k=n, analysed in [27].Keywords
All Related Versions
This publication has 25 references indexed in Scilit:
- Cutoff profiles for quantum Lévy processes and quantum random transpositionsProbability Theory and Related Fields, 2022
- Cutoff profile of ASEP on a segmentProbability Theory and Related Fields, 2022
- Limit profiles for reversible Markov chainsProbability Theory and Related Fields, 2021
- Cutoff on all Ramanujan graphsGeometric and Functional Analysis, 2016
- The Spectrum and Convergence Rates of Exclusion and Interchange Processes on the Complete GraphJournal of Theoretical Probability, 2015
- Total variation cutoff in birth-and-death chainsProbability Theory and Related Fields, 2008
- Harmonic Analysis on Finite Groups2008
- Time to Reach Stationarity in the Bernoulli–Laplace Diffusion Model with Many UrnsAdvances in Applied Mathematics, 1997
- Asymptotic analysis of a random walk on a hypercube with many dimensionsRandom Structures & Algorithms, 1990
- Generating a random permutation with random transpositionsProbability Theory and Related Fields, 1981