Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 95 tok/s
Gemini 2.5 Pro 51 tok/s Pro
GPT-5 Medium 21 tok/s Pro
GPT-5 High 17 tok/s Pro
GPT-4o 103 tok/s Pro
Kimi K2 236 tok/s Pro
GPT OSS 120B 465 tok/s Pro
Claude Sonnet 4 38 tok/s Pro
2000 character limit reached

Cutoff profile of the Metropolis biased card shuffling (2208.13383v1)

Published 29 Aug 2022 in math.PR, cs.DM, math-ph, math.CO, and math.MP

Abstract: We consider the Metropolis biased card shuffling (also called the multi-species ASEP on a finite interval or the random Metropolis scan). Its convergence to stationary was believed to exhibit a total-variation cutoff, and that was proved a few years ago by Labb\'e and Lacoin. In this paper, we prove that (for $N$ cards) the cutoff window is in the order of $N{1/3}$, and the cutoff profile is given by the GOE Tracy-Widom distribution function. This confirms a conjecture by Bufetov and Nejjar. Our approach is different from Labb\'e-Lacoin, by comparing the card shuffling with the multi-species ASEP on $\mathbb{Z}$, and using Hecke algebra and recent ASEP shift-invariance and convergence results. Our result can also be viewed as a generalization of the Oriented Swap Process finishing time convergence of Bufetov-Gorin-Romik, which is the TASEP version (of our result).

Citations (5)

Summary

We haven't generated a summary for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)