A general lower bound for mixing of single-site dynamics on graphs

Details A general lower bound for mixing of single-site dynamics on graphs A general lower bound for mixing of single-site dynamics on graphs

2005-07-25

arxiv.org/abs/math/0507517v2

Annals of Applied Probability 2007, Vol. 17, No. 3, 931-952

Mathematics

Probability

Published at http://dx.doi.org/10.1214/105051607000000104 in the Annals of Applied Probability (http://www.imstat.org/aap/) by

Scientific paper

10.1214/105051607000000104

We prove that any Markov chain that performs local, reversible updates on randomly chosen vertices of a bounded-degree graph necessarily has mixing time at least $\Omega(n\log n)$, where $n$ is the number of vertices. Our bound applies to the so-called ``Glauber dynamics'' that has been used extensively in algorithms for the Ising model, independent sets, graph colorings and other structures in computer science and statistical physics, and demonstrates that many of these algorithms are optimal up to constant factors within their class. Previously, no superlinear lower bound was known for this class of algorithms. Though widely conjectured, such a bound had been proved previously only in very restricted circumstances, such as for the empty graph and the path. We also show that the assumption of bounded degree is necessary by giving a family of dynamics on graphs of unbounded degree with mixing time O(n).

Affiliated with

Also associated with

No associations

Rating

A general lower bound for mixing of single-site dynamics on graphs 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 A general lower bound for mixing of single-site dynamics on graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A general lower bound for mixing of single-site dynamics on graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-53311