Sequential cavity method for computing free energy and surface pressure

Abstract

We propose a new method for the problems of computing free energy and surface pressure for various statistical mechanics models on a lattice ${\mathbb{Z}}^d$. Our method is based on representing the free energy and surface pressure in terms of certain marginal probabilities in a suitably modified sublattice of ${\mathbb{Z}}^d$. Then recent deterministic algorithms for computing marginal probabilities are used to obtain numerical estimates of the quantities of interest. The method works under the assumption of Strong Spatial Mixing (SSP), which is a form of a correlation decay. We illustrate our method for the hard-core and monomer-dimer models, and improve several earlier estimates. For example we show that the exponent of the monomer-dimer coverings of ${\mathbb{Z}}^3$ belongs to the interval $[0.78595,0.78599]$, improving best previously known estimate of (approximately) $[0.7850,0.7862]$ obtained in \cite{FriedlandPeled},\cite{FriedlandKropLundowMarkstrom}. Moreover, we show that given a target additive error $\epsilon >0$, the computational effort of our method for these two models is $(1/\epsilon {)}^{O(1)}$ \emph{both} for free energy and surface pressure. In contrast, prior methods, such as transfer matrix method, require $\exp ((1/\epsilon {)}^{O(1)})$ computation effort.

33 pages, 4 figures

References in corpus (3)

• Glass models on Bethe lattices
• Approximating the monomer-dimer constants through matrix permanent
• Exact asymptotics of monomer-dimer model on rectangular semi-infinite lattices

Cited by in corpus (12)

• Algorithmic Pirogov-Sinai theory
• Representation and poly-time approximation for pressure of ${\mathbb{Z}}^2$ lattice models in the non-uniqueness region
• Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy
• Strong spatial mixing for repulsive point processes
• Power series expansions for the planar monomer-dimer problem
• Strong spatial mixing in homomorphism spaces
• Computing bounds for entropy of stationary Z^d Markov random fields
• Approximate Capacities of Two-Dimensional Codes by Spatial Mixing
• Upper bounds on the growth rates of hard squares and related models via corner transfer matrices
• Matchings on Random Regular Hypergraphs
• Errata and Addenda to Mathematical Constants
• Tree shift topological entropy