MIXING OF THE SYMMETRIC EXCLUSION PROCESSES IN TERMS OF THE CORRESPONDING SINGLE-PARTICLE RANDOM WALK

We prove an upper bound for the epsilon-mixing time of the symmetric exclusion process on any graph G, with any feasible number of particles. Our estimate is proportional to T-RW(G) ln(vertical bar V vertical bar/epsilon), where vertical bar V vertical bar is the number of vertices in G, and T-RW(G) 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 R-d. Our technical tools include a variant of Morris's chameleon process.