Limit Profile for Projections of Random Walks on Groups
From MaRDI portal
Ordinary representations and characters (20C15) Representations of finite symmetric groups (20C30) Fourier and Fourier-Stieltjes transforms on nonabelian groups and on semigroups, etc. (43A30) Representations of groups, semigroups, etc. (aspects of abstract harmonic analysis) (43A65) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15) Combinatorial probability (60C05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
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 -bounds, are typically too crude to establish this and there has been a push to develop general techniques. We build upon this work, extending from conjugacy-invariant random walks on groups to certain projections. We exemplify our method by analysing the -particle interchange process on the complete -graph with . This is a projection of the random-transpositions card shuffle, which corresponds to , analysed by Teyssier.
This page was built for publication: Limit Profile for Projections of Random Walks on Groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6411994)
