University of Cambridge > Talks.cam > Probability > Mixing times of exclusion processes on regular 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 times of exclusion processes on regular graphs

Download to your calendar using vCal

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

Place k black particles and n-k white particles on the vertices of an n vertex graph, with one per vertex. Suppose each edge rings at rate 1 independently, and when an edge rings particles at the end-points switch positions. Oliveira conjectured that this “k-particle exclusion process” has mixing time of order at most that of k independent particles. Together with Jonathan Hermon we prove a bound for regular graphs which is in general within a log log n factor from this conjecture when k>n^c and which, in certain cases, verifies the conjecture. As a result we obtain new mixing time bounds for the exclusion process on expanders and the hypercube.

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

.. DELETED .. Odd perfect numbers CUED LT0

Other talks

Morning Break The role of radiation in cancer care: a spotlight on cancers of the oesophagus, head and neck Zooming in on the assembly of galaxies in the early Universe Welfare Reform and the Imperative of Cooperation The Play Paradox: How video games build better humans Online Causal Inference Seminar
 

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