Forest expansion of two-body partition functions for sparse interaction graphs

Abstract

We study tree approximations to classical two-body partition functions on sparse and loopy graphs via the Brydges-Kennedy-Abdessalam-Rivasseau forest expansion. We show that for sparse graphs (with large cycles), the partition function above a certain temperature $T^{\ast }$ can be approximated by a graph polynomial expansion over forests of the interaction graph. Within this "forest phase", we show that the approximation can be written in terms of a reference tree $\mathcal{T}$ on the interaction graph, with corrections due to cycles. From this point of view, this implies that high-temperature models are easy to solve on sparse graphs, as one can evaluate the partition function using belief propagation. We also show that there exists a high- and low-temperature regime, in which $\mathcal{T}$ can be obtained via a maximal spanning tree algorithm on a (given) weighted graph. We study the algebra of these corrections and provide first- and second-order approximation to the tree Ansatz, and give explicit examples for the first-order approximation.

36 pages; paper expanded

References in corpus (10)

• Loop series for discrete statistical models on graphs
• The 1/N expansion of colored tensor models
• Message passing on networks with loops
• Scaling behaviour of three-dimensional group field theory
• Effective field theory for models defined over small-world networks. First and second order phase transitions
• Ising spin glass models versus Ising models: an effective mapping at high temperature II. Applications to graphs and networks
• Loop series expansion with propagation diagrams
• GEMs and amplitude bounds in the colored Boulatov model
• On a "continuum" formulation of the Ising model partition function
• Statistical physics of loopy interactions: Independent-loop approximation and beyond