Fast sampling via spectral independence beyond bounded-degree graphs

by   Ivona Bezakova, et al.

Spectral independence is a recently-developed framework for obtaining sharp bounds on the convergence time of the classical Glauber dynamics. This new framework has yielded optimal O(n log n) sampling algorithms on bounded-degree graphs for a large class of problems throughout the so-called uniqueness regime, including, for example, the problems of sampling independent sets, matchings, and Ising-model configurations. Our main contribution is to relax the bounded-degree assumption that has so far been important in establishing and applying spectral independence. Previous methods for avoiding degree bounds rely on using L^p-norms to analyse contraction on graphs with bounded connective constant (Sinclair, Srivastava, Yin; FOCS'13). The non-linearity of L^p-norms is an obstacle to applying these results to bound spectral independence. Our solution is to capture the L^p-analysis recursively by amortising over the subtrees of the recurrence used to analyse contraction. Our method generalises previous analyses that applied only to bounded-degree graphs. As a main application of our techniques, we consider the random graph G(n,d/n), where the previously known algorithms run in time n^O(log d) or applied only to large d. We refine these algorithmic bounds significantly, and develop fast n^1+o(1) algorithms based on Glauber dynamics that apply to all d, throughout the uniqueness regime.


page 1

page 2

page 3

page 4


Sampling from Potts on random graphs of unbounded degree via random-cluster dynamics

We consider the problem of sampling from the ferromagnetic Potts and ran...

Algorithms for #BIS-hard problems on expander graphs

We give an FPTAS and an efficient sampling algorithm for the high-fugaci...

Entropic Independence II: Optimal Sampling and Concentration via Restricted Modified Log-Sobolev Inequalities

We introduce a framework for obtaining tight mixing times for Markov cha...

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,...

Optimal mixing for two-state anti-ferromagnetic spin systems

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

From algorithms to connectivity and back: finding a giant component in random k-SAT

We take an algorithmic approach to studying the solution space geometry ...

Rapid Mixing for Colorings via Spectral Independence

The spectral independence approach of Anari et al. (2020) utilized recen...

Please sign up or login with your details

Forgot password? Click here to reset