Search for: All records

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 “weak.” Instead, recent work of Jenssen, Keevash, and Perkins yields polynomial‐time algorithms in the low‐temperature regime on bounded‐degree (bipartite) expander graphs using polymer models and the cluster expansion. In order to speed up these algorithms (so the exponent in the run time does not depend on the degree bound) we present a Markov chain for polymer models and show that it is rapidly mixing under exponential decay of polymer weights. This yields, for example, an‐time sampling algorithm for the low‐temperature ferromagnetic Potts model on bounded‐degree expander graphs. Combining our results for the hard‐core and Potts models with Markov chain comparison tools, we obtain polynomial mixing time for Glauber dynamics restricted to appropriate portions of the state space. 

Abstract We determine the asymptotics of the number of independent sets of size $$\lfloor \beta 2^{d-1} \rfloor$$ in the discrete hypercube $$Q_d = \{0,1\}^d$$ for any fixed $$\beta \in (0,1)$$ as $$d \to \infty$$ , extending a result of Galvin for $$\beta \in (1-1/\sqrt{2},1)$$ . Moreover, we prove a multivariate local central limit theorem for structural features of independent sets in $$Q_d$$ drawn according to the hard-core model at any fixed fugacity $$\lambda>0$$ . In proving these results we develop several general tools for performing combinatorial enumeration using polymer models and the cluster expansion from statistical physics along with local central limit theorems.