%0 Generic %1 arXiv:0707.3241 %A Mossel, Elchanan %A Sly, Allan %D 2007 %K author_Sly__Allan %T Gibbs Rapidly Samples Colorings of G(n,d/n). %U http://arxiv.org/abs/0707.3241 %X Gibbs sampling also known as Glauber dynamics is a popular technique for sampling high dimensional distributions defined on graphs. Of special interest is the behavior of Gibbs sampling on the Erdős-Rényi random graph G(n,d/n). While the average degree in G(n,d/n) is d(1-o(1)), it contains many nodes of degree of order $n / n$. The existence of nodes of almost logarithmic degrees implies that for many natural distributions defined on G(n,p) such as uniform coloring or the Ising model, the mixing time of Gibbs sampling is at least $n^1 + Ømega(1 / łog n)$. High degree nodes pose a technical challenge in proving polynomial time mixing of the dynamics for many models including coloring. In this work consider sampling q-colorings and show that for every $d < ınfty$ there exists $q(d) < ınfty$ such that for all $q q(d)$ the mixing time of Gibbs sampling on G(n,d/n) is polynomial in $n$ with high probability. Our results are the first polynomial time mixing results proven for the coloring model on G(n,d/n) for d > 1 where the number of colors does not depend on n. They extend to much more general families of graphs which are sparse in some average sense and to much more general interactions. The results also generalize to the hard-core model at low fugacity and to general models of soft constraints at high temperatures.

@misc{arXiv:0707.3241, abstract = {Gibbs sampling also known as Glauber dynamics is a popular technique for sampling high dimensional distributions defined on graphs. Of special interest is the behavior of Gibbs sampling on the Erdős-Rényi random graph G(n,d/n). While the average degree in G(n,d/n) is d(1-o(1)), it contains many nodes of degree of order $\log n / \log \log n$. The existence of nodes of almost logarithmic degrees implies that for many natural distributions defined on G(n,p) such as uniform coloring or the Ising model, the mixing time of Gibbs sampling is at least $n^{1 + \Omega(1 / \log \log n)}$. High degree nodes pose a technical challenge in proving polynomial time mixing of the dynamics for many models including coloring. In this work consider sampling q-colorings and show that for every $d < \infty$ there exists $q(d) < \infty$ such that for all $q \geq q(d)$ the mixing time of Gibbs sampling on G(n,d/n) is polynomial in $n$ with high probability. Our results are the first polynomial time mixing results proven for the coloring model on G(n,d/n) for d > 1 where the number of colors does not depend on n. They extend to much more general families of graphs which are sparse in some average sense and to much more general interactions. The results also generalize to the hard-core model at low fugacity and to general models of soft constraints at high temperatures.}, added-at = {2008-01-25T06:08:08.000+0100}, arxiv = {arXiv:0707.3241}, author = {Mossel, Elchanan and Sly, Allan}, biburl = {https://www.bibsonomy.org/bibtex/2f190c7cd0a3745936d45985e6d072bfc/pitman}, interhash = {1f458d6861fa4a0cbe4983ae5d7cf617}, intrahash = {f190c7cd0a3745936d45985e6d072bfc}, keywords = {author_Sly__Allan}, timestamp = {2008-01-25T06:09:11.000+0100}, title = {{Gibbs Rapidly Samples Colorings of G(n,d/n).}}, url = {http://arxiv.org/abs/0707.3241}, year = 2007 }