From Coupling to Spectral Independence and Blackbox Comparison with the Down-Up Walk

03/22/2021
by   Kuikui Liu, et al.
0

We show that the existence of a “good” coupling w.r.t. Hamming distance for any local Markov chain on a discrete product space implies rapid mixing of the Glauber dynamics in a blackbox fashion. More specifically, we only require the expected distance between successive iterates under the coupling to be summable, as opposed to being one-step contractive in the worst case. Combined with recent local-to-global arguments <cit.>, we establish asymptotically optimal lower bounds on the standard and modified log-Sobolev constants for the Glauber dynamics for sampling from spin systems on bounded-degree graphs when a curvature condition <cit.> is satisfied. To achieve this, we use Stein's method for Markov chains <cit.> to show that a “good” coupling for a local Markov chain yields strong bounds on the spectral independence of the distribution in the sense of <cit.>. Our primary application is to sampling proper list-colorings on bounded-degree graphs. In particular, combining the coupling for the flip dynamics given by <cit.> with our techniques, we show optimal O(nlog n) mixing for the Glauber dynamics for sampling proper list-colorings on any bounded-degree graph with maximum degree Δ whenever the size of the color lists are at least (11/6 - ϵ)Δ, where ϵ≈ 10^-5 is small constant. While O(n^2) mixing was already known before, our approach additionally yields Chernoff-type concentration bounds for Hamming Lipschitz functions in this regime, which was not known before. Our approach is markedly different from prior works establishing spectral independence for spin systems using spatial mixing <cit.>, which crucially is still open in this regime for proper list-colorings.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/12/2021

On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization

For general spin systems, we prove that a contractive coupling for any l...
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
11/07/2021

Simple Parallel Algorithms for Single-Site Dynamics

The single-site dynamics are a canonical class of Markov chains for samp...
research
03/08/2022

Localization Schemes: A Framework for Proving Mixing Bounds for Markov Chains

Two recent and seemingly-unrelated techniques for proving mixing bounds ...
research
04/09/2018

Linear Programming Bounds for Randomly Sampling Colorings

Here we study the problem of sampling random proper colorings of a bound...
research
10/30/2018

Improved Bounds for Randomly Sampling Colorings via Linear Programming

A well-known conjecture in computer science and statistical physics is t...
research
08/13/2020

Dynamic Complexity of Expansion

Dynamic Complexity was introduced by Immerman and Patnaik <cit.> (see al...

Please sign up or login with your details

Forgot password? Click here to reset