Gibbs Rapidly Samples Colorings of G(n,d/n)
Elchanan Mossel, Allan Sly

TL;DR
This paper proves that Gibbs sampling for q-colorings on Erdős-Rényi graphs G(n,d/n) mixes in polynomial time for sufficiently large q, extending to broader sparse graph models and other statistical physics models.
Contribution
It establishes the first polynomial mixing time results for coloring models on G(n,d/n) with a fixed number of colors, independent of n.
Findings
Gibbs sampling mixes rapidly for large enough q on G(n,d/n)
Results extend to sparse graphs with average degree constraints
Applicable to other models like the hard-core and soft constraint models
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\H{o}s-R\'enyi 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 . 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 . 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 there exists such that for all the mixing time of Gibbs…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Stochastic processes and statistical mechanics · Bayesian Methods and Mixture Models
