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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Hyperplane arrangements and Stopping times

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

FW26, William Gates Building. Zoom link: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon Average on weekdays: 8952.87704918 kWh The best of Telluride Mountainfilm Festival

Other talks

Title to be confirmed Disentangling preventative & ejective AGN feedback on a population basis with simulations, observations & machine learning Quantum graphs with a time asymmetry: spectral optimization and spectral statistics Talk TBC Sheref Mansy, topic TBA Title to be confirmed
 

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