Random walks on hyperplane arrangements and stopping times

2016/05/26 by Evita Nestoridi, Nestoridi, Evita
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Algorithms and Data Compression #Combinatorics (math.CO) #FOS: Mathematics #Probability (math.PR) #Stochastic processes and statistical mechanics

paper · pdf · doi:10.48550/arxiv.1605.08339

openalex publication_date 2016/05/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Optimal strong stationary times for random walks on the chambers of a\n hyperplane arrangement
• Functions of random walks on hyperplane arrangements
• Stopping Times of Random Walks on a Hypercube
• A note on random walks in a hypercube
• Random walks, arrangements, cell complexes, greedoids, and self-organizing libraries