University of Cambridge > Talks.cam > Probability > Mixing-time and cut-off window for the exclusion process on 1-dimensional graphs

  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

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

Download to your calendar using vCal

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

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 on a site which is already occupied.

The equilibrium state for this dynamics is the uniform measure over all possible particle configuration, and in our talk we want to investigate how much time the system needs to reach equilibrium in terms of total variation distance. We give a sharp answer for both the segment and the circle and discuss the connection with the adjacent transposition shuffle.

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

Clinical School Lecture Theatre 2 Zoom - register via https://cam-ac-uk.zoom.us/meeting/register/tJIrcuCtrzwuGNfHqCBIhkDlQIdIgKpNANqo CMS, Pav. B, MR9 (B0.09)

Other talks

Cooperation for Nature Group Work Online Causal Inference Seminar Group Work From lab to clinic: an introduction to translational research The Play Paradox: How video games build better humans
 

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