Optimal strong stationary times for random walks on the chambers of a hyperplane arrangement

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish (US)
Pages (from-to)929-943
Number of pages15
JournalProbability Theory and Related Fields
Volume174
Issue number3-4
DOIs
StatePublished - Aug 1 2019

All Science Journal Classification (ASJC) codes

  • Analysis
  • Statistics and Probability
  • Statistics, Probability and Uncertainty

Fingerprint Dive into the research topics of 'Optimal strong stationary times for random walks on the chambers of a hyperplane arrangement'. Together they form a unique fingerprint.

Cite this