Optimal strong stationary times for random walks on the chambers of a hyperplane arrangement
From MaRDI portal
Publication:2312684
DOI10.1007/S00440-018-0872-7zbMATH Open1481.60138arXiv1706.00310OpenAlexW2964121456WikidataQ129245971 ScholiaQ129245971MaRDI QIDQ2312684
Author name not available (Why is that?)
Publication date: 17 July 2019
Published in: (Search for Journal in Brave)
Abstract: 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.
Full work available at URL: https://arxiv.org/abs/1706.00310
No records found.
No records found.
This page was built for publication: Optimal strong stationary times for random walks on the chambers of a hyperplane arrangement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2312684)
