

























We prove that the single-site Glauber dynamics for sampling proper $q$-colorings mixes in $O_Δ(n\log n)$ time on line graphs with $n$ vertices and maximum degree $Δ$ when $q>(1+o(1))Δ$. The main tool in our proof is the matrix trickle-down theorem developed by Abdolazimi, Liu and Oveis Gharan (FOCS, 2021).
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。