Sampling Proper Colorings on Line Graphs Using $(1+o(1))\Delta$ Colors

Yulin Wang,Chihao Zhang, Zihan Zhang

arxiv（2023）

引用 0|浏览4

暂无评分

摘要

We prove that the single-site Glauber dynamics for sampling proper $q$-colorings mixes in $O_\Delta(n\log n)$ time on line graphs with $n$ vertices and maximum degree $\Delta$ when $q>(1+o(1))\Delta$. The main tool in our proof is the matrix trickle-down theorem developed by Abdolazimi, Liu and Oveis Gharan (FOCS, 2021).

查看译文

关键词

proper colorings,line graphs,sampling,colors

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要