Mixing Time of the Random-Pair Monte Shuffle
cs.DM, math.PR
Submitted: 2026-11-02
Updated: 2026-11-02
Code: https://github.com/openai/math
Terminology
Sources
- Sampling Directed Eulerian Tours in $\widetilde O(m^{3/2})$ Time
- An Enciphering Scheme Based on a Card Shuffle
- Hitting time mixing for the random transposition walk
- The mixing time of the Thorp shuffle
- Shuffling by semi-random transpositions
- Limit profile for random transpositions
- A strong stationary time for random transpositions
Related papers
- Low-Temperature Sampling via Equilibrium Disagreements
- An Improved Bound for Testing k-Colorability
- Temporal Cliques Admit Linear Spanners
- Multiway Partition is FPT for Connectivity Functions
- Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
- Constrained intersection representations and forbidden patterns