Rapid Mixing via Coupling Independence for Spin Systems with Unbounded Degree
Xiaoyu Chen, Weiming Feng

TL;DR
This paper introduces a new coupling independence framework to analyze rapid mixing times of Glauber dynamics in unbounded degree spin systems, achieving optimal or near-optimal results for coloring and hardcore models.
Contribution
It develops a novel framework for proving rapid mixing in unbounded degree spin systems, applicable to various models and improving existing bounds.
Findings
Proves $O(n)$ relaxation time for random $q$-list-coloring under certain conditions.
Establishes $O(n)$ relaxation time and near-linear mixing for hardcore models in balanced bipartite graphs.
Introduces coupling independence as a key technique for analyzing Glauber dynamics.
Abstract
We develop a new framework to prove the mixing or relaxation time for the Glauber dynamics on spin systems with unbounded degree. It works for general spin systems including both -spin and multi-spin systems. As applications for this approach: We prove the optimal relaxation time for the Glauber dynamics of random -list-coloring on an -vertices triangle-tree graph with maximum degree such that , where is the unique positive solution of the equation . This improves the relaxation time for Glauber dynamics obtained by the previous work of Jain, Pham, and Vuong (2022). Besides, our framework can also give a near-linear time sampling algorithm under the same condition. We prove the optimal relaxation time and near-optimal …
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.
