← 研踪 PaperTrailarXiv:2611.19829 · v1
Optimal mixing of random-to-random shuffling on linear extensions
首次提交 2026-11-15 14:17
版本更新 2026-11-15 14:17
雷达观测 2026-11-17 12:06
摘要
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 .
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-15 14:17 · 最新观测版本
Optimal mixing of random-to-random shuffling on linear extensions
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 .
查看此版本解读 →查看此版本原文 ↗