Probability Seminar: Mixing-time and cut-off window for the exclusion process on 1-dimensional graphs

Probability Seminar: Mixing-time and cut-off window for the exclusion process on 1-dimensional graphs

Probability Seminar
Feb 19, 2014, 03:00 PM - 04:00 PM | 332 Evans Hall | Happening As Scheduled
Hubert Lacoin, University Paris Dauphine
We consider the exclusion process with k particle on the circle or segment of lenght N (with k\le N/2). This is a Markov chain that can be described as follows: k (unlabeled) particles are moving on a graph with the rule that each site can be occupied only by one particle, each particle jump with rate one on each of the neighboring sites, but the jumps are cancelled when a particle tries to jump...