Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk

Speaker  Roberto Oliviera

Affiliation  IMPA

Host  David Wilson

Duration  00:43:43

Date recorded  20 October 2013

We prove an upper bound for the mixing time of the symmetric exclusion process on any graph G, with any feasible number of particles. Our estimate is proportional to the mixing time of the corresponding single-particle random walk times a log |V| term, where |V| is the number of vertices. This bound implies new results for symmetric exclusion on expanders, percolation clusters, the giant component of the Erdos-Renyi random graph and Poisson point processes. Our technical tools include a variant of Morris's chameleon process.

©2013 Microsoft Corporation. All rights reserved.
> Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk