Rapid Mixing for Sampling Colorings of Random Graphs up to Tree Uniqueness Threshold

We study the mixing time of the single-site Glauber dynamics for sampling proper $q$-colorings on sparse Erdős-Rényi random graphs $\mathcal{G}(n,d\mathrm{/}n)$. We prove that, whenever $q\ge (1+o_d(1))d$, Glauber dynamics mixes in polynomial time with high probability over $\mathcal{G}(n,d\mathrm{/}n)$ for all sufficiently large integer $n$. This improves the previous bound $q=({\alpha }^{\ast }+o_d(1))d$ where ${\alpha }^{\ast }=\mathrm{1.7632...}$ is the unique solution of $x=\exp (1\mathrm{/}x)$ on $[1,\mathrm{\infty })$ by Efthymiou, Hayes, Štefankovič, and Vigoda (SODA, 2018) and asymptotically matches the uniqueness threshold on infinite regular trees. Our proof has three main ingredients. First we establish logarithmic bounds on the spectral and coupling independence constants of the Gibbs distribution by extending the tree analysis of Chen, Liu, Mani, and Moitra (J. ACM, 2026). Second, we extend the entropy-factorization framework for two-spin systems on random graphs, developed by Bezáková, Galanis, Goldberg, and Štefankovič (TALG, 2024), to proper colorings by introducing a buffer around high-degree vertices. Finally, we compare the resulting heat-bath block dynamics with the single-site Glauber dynamics.