Rapid mixing of Glauber dynamics via spectral independence for all degrees

05/31/2021
by   Xiaoyu Chen, et al.
0

We prove an optimal Ω(n^-1) lower bound on the spectral gap of Glauber dynamics for anti-ferromagnetic two-spin systems with n vertices in the tree uniqueness regime. This spectral gap holds for all, including unbounded, maximum degree Δ. Consequently, we have the following mixing time bounds for the models satisfying the uniqueness condition with a slack δ∈(0,1): ∙ C(δ) n^2log n mixing time for the hardcore model with fugacity λ≤ (1-δ)λ_c(Δ)= (1-δ)(Δ - 1)^Δ - 1/(Δ - 2)^Δ; ∙ C(δ) n^2 mixing time for the Ising model with edge activity β∈[Δ-2+δ/Δ-δ,Δ-δ/Δ-2+δ]; where the maximum degree Δ may depend on the number of vertices n, and C(δ) depends only on δ. Our proof is built upon the recently developed connections between the Glauber dynamics for spin systems and the high-dimensional expander walks. In particular, we prove a stronger notion of spectral independence, called the complete spectral independence, and use a novel Markov chain called the field dynamics to connect this stronger spectral independence to the rapid mixing of Glauber dynamics for all degrees.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/15/2022

Optimal mixing for two-state anti-ferromagnetic spin systems

We prove an optimal Ω(n^-1) lower bound for modified log-Sobolev (MLS) c...
research
02/13/2023

On the Mixing Time of Glauber Dynamics for the Hard-core and Related Models on G(n,d/n)

We study the single-site Glauber dynamics for the fugacity λ, Hard-core ...
research
11/07/2022

Spectral Independence Beyond Uniqueness using the topological method

We present novel results for fast mixing of Glauber dynamics using the n...
research
07/25/2023

Spectral Independence Lecture Notes

These are self-contained lecture notes for spectral independence. For an...
research
11/04/2021

Optimal Mixing Time for the Ising Model in the Uniqueness Regime

We prove an optimal O(n log n) mixing time of the Glauber dynamics for t...
research
07/02/2023

Rapid mixing of global Markov chains via spectral independence: the unbounded degree case

We consider spin systems on general n-vertex graphs of unbounded degree ...
research
07/16/2020

The Swendsen-Wang Dynamics on Trees

The Swendsen-Wang algorithm is a sophisticated, widely-used Markov chain...

Please sign up or login with your details

Forgot password? Click here to reset