Papers
Topics
Authors
Recent
Search
2000 character limit reached

Spectral independence, coupling with the stationary distribution, and the spectral gap of the Glauber dynamics

Published 3 May 2021 in cs.DS and math.PR | (2105.01201v1)

Abstract: We present a new lower bound on the spectral gap of the Glauber dynamics for the Gibbs distribution of a spectrally independent qq-spin system on a graph G=(V,E)G = (V,E) with maximum degree Δ\Delta. Notably, for several interesting examples, our bound covers the entire regime of Δ\Delta excluded by arguments based on coupling with the stationary distribution. As concrete applications, by combining our new lower bound with known spectral independence computations and known coupling arguments: (1) We show that for a triangle-free graph G=(V,E)G = (V,E) with maximum degree Δ3\Delta \geq 3, the Glauber dynamics for the uniform distribution on proper kk-colorings with k(1.763+δ)Δk \geq (1.763\dots + \delta)\Delta colors has spectral gap Ω~<em>δ(V<sup>1)\tilde{\Omega}<em>{\delta}(|V|<sup>{-1}). Previously, such a result was known either if the girth of GG is at least $5$ [Dyer et.~al, FOCS 2004], or under restrictions on Δ\Delta [Chen et.~al, STOC 2021; Hayes-Vigoda, FOCS 2003]. (2) We show that for a regular graph G=(V,E)G = (V,E) with degree Δ3\Delta \geq 3 and girth at least $6$, and for any $\varepsilon, \delta &gt; 0$, the partition function of the hardcore model with fugacity λ(1δ)λ</em>c(Δ)\lambda \leq (1-\delta)\lambda</em>{c}(\Delta) may be approximated within a (1+ε)(1+\varepsilon)-multiplicative factor in time O~<em>δ(n<sup>2ε<sup>2)\tilde{O}<em>{\delta}(n<sup>{2}\varepsilon<sup>{-2}). Previously, such a result was known if the girth is at least $7$ [Efthymiou et.~al, SICOMP 2019]. (3) We show for the binomial random graph G(n,d/n)G(n,d/n) with d=O(1)d = O(1), with high probability, an approximately uniformly random matching may be sampled in time O</em>d(n<sup>2+o(1))O</em>{d}(n<sup>{2+o(1)}). This improves the corresponding running time of O~d(n<sup>3)\tilde{O}_{d}(n<sup>{3}) due to [Jerrum-Sinclair, SICOMP 1989; Jerrum, 2003].

Citations (18)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.