WorksComputer Science
Optimal mixing of random-to-random shuffling on linear extensions
Abstract
Uniform sampling of linear extensions is a basic problem in randomized algorithms and the study of finite posets. We prove that the random-to-random shuffle of Ayyer, Schilling, and Thiéry mixes in steps on every -element poset, establishing their conjectured mixing order. With constant-time order queries, this gives an -approximate uniform sampler using elementary operations after preprocessing. The proof establishes relative-entropy contraction by a factor for the promotion half-step. Consequently, the uniform extended-promotion chain has the same mixing order. We represent complete promotion scans as reflected coordinate paths in the order polytope and prove that a convex potential with gradients in the same polytope has diagonal Hessian mass at most one along each path. Applying this estimate to an optimal transport potential yields a sharp entropy factorization for every finite-entropy input. Linearization also gives the spectral-gap lower bound .