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

05/03/2021
by   Vishesh Jain, et al.
0

We present a new lower bound on the spectral gap of the Glauber dynamics for the Gibbs distribution of a spectrally independent q-spin system on a graph G = (V,E) with maximum degree Δ. Notably, for several interesting examples, our bound covers the entire regime of Δ 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) with maximum degree Δ≥ 3, the Glauber dynamics for the uniform distribution on proper k-colorings with k ≥ (1.763… + δ)Δ colors has spectral gap Ω̃_δ(|V|^-1). Previously, such a result was known either if the girth of G is at least 5 [Dyer et. al, FOCS 2004], or under restrictions on Δ [Chen et. al, STOC 2021; Hayes-Vigoda, FOCS 2003]. (2) We show that for a regular graph G = (V,E) with degree Δ≥ 3 and girth at least 6, and for any ε, δ > 0, the partition function of the hardcore model with fugacity λ≤ (1-δ)λ_c(Δ) may be approximated within a (1+ε)-multiplicative factor in time Õ_δ(n^2ε^-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) with d = O(1), with high probability, an approximately uniformly random matching may be sampled in time O_d(n^2+o(1)). This improves the corresponding running time of Õ_d(n^3) due to [Jerrum-Sinclair, SICOMP 1989; Jerrum, 2003].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/16/2020

Rapid Mixing for Colorings via Spectral Independence

The spectral independence approach of Anari et al. (2020) utilized recen...
research
02/25/2020

Coloring triangle-free L-graphs with O(loglog n) colors

It is proved that triangle-free intersection graphs of n L-shapes in the...
research
07/16/2020

Rapid mixing from spectral independence beyond the Boolean domain

We extend the notion of spectral independence (introduced by Anari, Liu,...
research
06/05/2021

Time-Optimal Sublinear Algorithms for Matching and Vertex Cover

We present a near-tight analysis of the average "query complexity" – à l...
research
04/27/2023

Fast Sampling of b-Matchings and b-Edge Covers

For an integer b ≥ 1, a b-matching (resp. b-edge cover) of a graph G=(V,...
research
02/26/2019

A new lower bound on the maximum number of plane graphs using production matrices

We use the concept of production matrices to show that there exist sets ...
research
11/20/2019

Online Spectral Approximation in Random Order Streams

This paper studies spectral approximation for a positive semidefinite ma...

Please sign up or login with your details

Forgot password? Click here to reset