























This paper studies Markov chains on the chambers of real hyperplane arrangements, a model that generalizes famous examples, such as the Tsetlin library and riffle shuffles. We discuss cutoff for the Tsetlin library for general weights, and we give an exact formula for the separation distance for the hyperplane arrangement walk. We introduce lower bounds, which allow for the first time to study cutoff for hyperplane arrangement walks under certain conditions. Using similar techniques, we also prove a uniform lower bound for the mixing time of Glauber dynamics on a monotone system.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。