We study the performance of Markov chains for the q-state ferromagnetic Potts model on
random regular graphs. While the cases of the grid and the complete graph are by now well …

We propose a polynomial-time algorithm for preparing the Gibbs state of the two-
dimensional toric code Hamiltonian at any temperature, starting from any initial condition …

We study the following combinatorial counting and sampling problems: can we sample from
the Erdős-Rényi random graph G(n,p) conditioned on triangle-freeness? Can we …

We give a near-linear time sampler for the Gibbs distribution of the ferromagnetic Ising
models with edge activities β> 1 and external fields λ< 1 (or symmetrically, λ> 1) on general …

A common obstruction to efficient sampling from high-dimensional distributions with Markov
chains is the multimodality of the target distribution because they may get trapped far from …

For general ferromagnetic Ising models whose coupling matrix has bounded spectral radius,
we show that the log‐Sobolev constant satisfies a simple bound expressed only in terms of …

There has been a recent surge of powerful tools to show rapid mixing of Markov chains, via
functional inequalities such as Poincar\'e inequalities. In many situations, Markov chains fail …

An important paradigm in the understanding of mixing times of Glauber dynamics for spin
systems is the correspondence between spatial mixing properties of the models and bounds …

We consider the problem of sampling a multimodal distribution with a Markov chain given a
small number of samples from the stationary measure. Although mixing can be arbitrarily …

We consider the problem of sampling from the ferromagnetic $ q $-state Potts model on the
random $ d $-regular graph with parameter $\beta> 0$. A key difficulty that arises in …