We say a probability distribution μ is spectrally independent if an associated pairwise
influence matrix has a bounded largest eigenvalue for the distribution and all of its …

We give a fully polynomial-time approximation scheme (FPTAS) and an efficient sampling
algorithm for the high-fugacity hard-core model on bounded-degree bipartite expander …

We prove an optimal lower bound on a spectral gap of the Glauber dynamics for
antiferromagnetic two-spin systems with vertices in the tree uniqueness regime. This …

We prove an optimal Ω(n^-1) lower bound for modified \log-Sobolev (MLS) constant of the
Glauber dynamics for anti-ferromagnetic two-spin systems with n vertices in the tree …

A well-known conjecture in computer science and statistical physics is that Glauber
dynamics on the set of k-colorings of a graph G on n vertices with maximum degree Δ is …

Efficient algorithms for approximate counting and sampling in spin systems typically apply in
the so‐called high‐temperature regime, where the interaction between neighboring spins is …

This paper considers how to obtain MCMC quantitative convergence bounds which can be
translated into tight complexity bounds in high-dimensional settings. We propose a modified …

We study the problem of approximating the partition function of the ferromagnetic Ising
model with both pairwise as well as higher order interactions (equivalently, in graphs as well …

We introduce a framework for obtaining tight mixing times for Markov chains based on what
we call restricted modified log-Sobolev inequalities. Modified log-Sobolev inequalities …

We give new algorithms based on Markov chains to sample and approximately count
satisfying assignments to k-uniform CNF formulas where each variable appears at most d …