BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Mixing times of exclusion processes on regular graphs - Richard Py
 mar (Birkbeck)
DTSTART:20190219T140000Z
DTEND:20190219T150000Z
UID:TALK119032@talks.cam.ac.uk
CONTACT:Perla Sousi
DESCRIPTION:Place k black particles and n-k white particles on the vertice
 s of an n vertex graph\, with one per vertex. Suppose each edge rings at r
 ate 1 independently\, and when an edge rings particles at the end-points s
 witch positions. Oliveira conjectured that this “k-particle exclusion pr
 ocess” has mixing time of order at most that of k independent particles.
  Together with Jonathan Hermon we prove a bound for regular graphs which i
 s 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 hyp
 ercube.
LOCATION:MR12\, CMS\, Wilberforce Road\, Cambridge\, CB3 0WB
END:VEVENT
END:VCALENDAR