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

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

2010-07-15

arxiv.org/abs/1007.2669v2

Mathematics

Probability

V2 has 46 pages including appendices. The presentation has been shortened and our version of Morris' chameleon process has bee

Scientific paper

We prove an upper bound for the eps-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(|V|/\eps), where |V| 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' chameleon process.

Affiliated with

Also associated with

No associations

Rating

Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-50366