Reproduce “Sampling Colorings on $G(n, d/n)$ via Glauber Dynamics” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Leon Schiller
The authors prove that Glauber dynamics can sample uniform proper colorings of sparse random graphs using buffered blocks to control high-degree vertices. For fixed 0<ε≤1/2 and sufficiently large fixed d, the result holds when q≥d+d^(1/2+ε). With high probability, mixing takes O(n^(2+ζ)(1+log(1/δ))) single-vertex updates; near-quadratic scaling requires q=O(d), and at ε=1/2 the threshold is 2d.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.