Probability Seminar

Hyperplane arrangements and stopping times
Monday, November 16, 2015 - 4:30pm to 5:30pm
Sequoia Hall, Room 200
Evita Nestoridi (Stanford)
Abstract / Description: 

Consider a real hyperplane arrangement and let C denote the collection of the occuring 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: the famous Tsetlin library used in dynamic file maintenance and cache maintenance and the riffle shuffles are two important examples of hyperplane walks. I introduce a strong stationary argument for this Markov chain, which provides explicit bounds for the separation distance. I will try to explain both the geometric and the probabilistic techniques used in the problem.


The Probability Seminars are held in Sequoia Hall, Room 200, at 4:30pm on Mondays. Refreshments are served at 4pm in the Lounge on the first floor.