The hit-and-run version of top-to-random

DOI10.1017/jpr.2021.96zbMath1497.60099arXiv2009.04977OpenAlexW3084174985MaRDI QIDQ5868534

Laurent Saloff-Coste, Daniel Rudolf, Samuel Boardman

Publication date: 21 September 2022

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.04977

zbMATH Keywords

Markov chaincard shufflingcut-off phenomenon

Mathematics Subject Classification ID

Processes with independent increments; Lévy processes (60G51) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Convergence of probability measures (60B10) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Positivity of hit-and-run and related algorithms
• The cutoff phenomenon for ergodic Markov processes
• Random walks and hyperplane arrangements
• Comparison techniques for random walk on finite groups
• Cutoff for random to random card shuffle
• Structure and eigenvalues of heat-bath Markov chains
• Refined estimates for some basic random walks on the symmetric and alternating groups
• Generating a random permutation with random transpositions
• Analysis of Top To Random Shuffles
• The cutoff phenomenon in finite Markov chains.
• Rapid mixing of Swendsen–Wang dynamics in two dimensions