Abstract
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 , where |V| is the number of vertices in G, and is the 1/4-mixing time of the corresponding single-particle random walk. 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 in . Our technical tools include a variant of Morris's chameleon process.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.