Fast Algorithms for General Spin Systems on Bipartite Expanders

A spin system is a framework in which the vertices of a graph are assigned spins from a finite set. The interactions between neighbouring spins give rise to weights, so a spin assignment can also be viewed as a weighted graph homomorphism. The problem of approximating the partition function (the aggregate weight of spin assignments) or of sampling from the resulting probability distribution is typically intractable for general graphs. In this work, we consider arbitrary spin systems on bipartite expander Δ-regular graphs, including the canonical class of bipartite random Δ-regular graphs. We develop fast approximate sampling and counting algorithms for general spin systems whenever the degree and the spectral gap of the graph are sufficiently large. Roughly, this guarantees that the spin system is in the so-called low-temperature regime. Our approach generalises the techniques of Jenssen et al. and Chen et al. by showing that typical configurations on bipartite expanders correspond to “bicliques” of the spin system; then, using suitable polymer models, we show how to sample such configurations and approximate the partition function in Õ( n 2 ) time, where n is the size of the graph.

Off-shell higher-spin fields in AdS4 and external currents

We construct an unfolded system for off-shell fields of arbitrary integer spin in 4d anti-de Sitter space. To this end we couple an on-shell system, encoding Fronsdal equations, to external Fronsdal currents for which we find an unfolded formulation. We present a reduction of the Fronsdal current system which brings it to the unfolded Fierz-Pauli system describing massive fields of arbitrary integer spin. Reformulating off-shell higher-spin system as the set of Schwinger–Dyson equations we compute propagators of higher-spin fields in the de Donder gauge directly from the unfolded equations. We discover operators that significantly simplify this computation, allowing a straightforward extraction of wave equations from an unfolded system.

Contraction: A Unified Perspective of Correlation Decay and Zero-Freeness of 2-Spin Systems

We study the connection between the correlation decay property (more precisely, strong spatial mixing) and the zero-freeness of the partition function of 2-spin systems on graphs of bounded degree. We show that for 2-spin systems on an entire family of graphs of a given bounded degree, the contraction property that ensures correlation decay exists for certain real parameters implies the zero-freeness of the partition function and the existence of correlation decay for some corresponding complex neighborhoods. Based on this connection, we are able to extend any real parameter of which the 2-spin system on graphs of bounded degree exhibits correlation decay to its complex neighborhood where the partition function is zero-free and correlation decay still exists. We give new zero-free regions in which the edge interaction parameters and the uniform external field are all complex-valued, and we show the existence of correlation decay for such complex regions. As a consequence, we obtain approximation algorithms for computing the partition function of 2-spin systems on graphs of bounded degree for these complex parameter settings.