University of Cambridge > Talks.cam > Probability > Hyperplane arrangements and Stopping times

Hyperplane arrangements and Stopping times

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Perla Sousi.

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.

This talk is part of the Probability series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2017 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity