Random walks on hyperplane arrangements and stopping times
Abstract
Consider a real hyperplane arrangement and let C denote the occurring chambers. Bidigare, Hanlon and Rockmore introduced a Markov chain on C which is a generalization of some card shuffling models used in computer science, biology and card games. This paper introduces strong stationary arguments for this Markov chain, which provide explicit bounds for the separation distance.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.