Limit profiles for projections of random walks on groups
Electronic Journal of Probability · 01.01.2024 · 29 (none) · 1-22
DOI: 10.1214/24-ejp1207 ↗Kurz gefasst
Fachartikel in der Zeitschrift Electronic Journal of Probability, erschienen am 01.01.2024. Verfasst von Evita Nestoridi und 1 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 28 Literaturangaben.
Abstract (Originalsprache)
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].
Zitieren
APA
Nestoridi, E., & Olesker-Taylor, S. (2024). Limit profiles for projections of random walks on groups. Electronic Journal of Probability, 29(none), 1-22. https://doi.org/10.1214/24-ejp1207
Vancouver
Nestoridi E, Olesker-Taylor S. Limit profiles for projections of random walks on groups. Electronic Journal of Probability. 2024;29(none):1-22. doi:10.1214/24-ejp1207
BibTeX
@article{Nestoridi2024,
author = {Nestoridi, Evita and Olesker-Taylor, Sam},
title = {Limit profiles for projections of random walks on groups},
journal = {Electronic Journal of Probability},
year = {2024},
volume = {29},
number = {none},
pages = {1--22},
doi = {10.1214/24-ejp1207}
}
EUVIMED