Showing math.PRShow all
3 papers · 1 filter
math.PR2026
A Harris recurrent continuous-time Markov process without wide-sense regenerative structure
Yanlin Qu, Peter Glynn
While Harris recurrent Markov chains (in discrete time) automatically exhibit wide-sense regenerative structure, we construct a Harris recurrent Markov process (in continuous time)…
math.PR2025
Computable Bounds on Convergence of Markov Chains in Wasserstein Distance via Contractive Drift
Yanlin Qu, Jose Blanchet, Peter Glynn
We introduce a unified framework to estimate the convergence of Markov chains to equilibrium in Wasserstein distance. The framework can provide convergence bounds with rates rangin…
math.PR2024
Rubik's Cube Scrambling Requires at Least 26 Random Moves
Yanlin Qu, Tomas Rokicki, Hillary Yang
Scrambling the standard 3x3x3 Rubik's Cube corresponds to a random walk on a group containing approximately 43 quintillion elements. Viewing the random walk as a Markov chain, its…