Fast algorithms for general spin systems on bipartite expanders

04/28/2020
by   Andreas Galanis, et al.
0

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. Our approach generalises the techniques of Jenseen 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/04/2021

Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region

For spin systems, such as the q-colorings and independent-set models, ap...
research
07/16/2019

Step-by-Step Community Detection for Volume-Regular Graphs

Spectral techniques have proved amongst the most effective approaches to...
research
03/18/2019

Counting independent sets and colorings on random regular bipartite graphs

We give a fully polynomial-time approximation scheme (FPTAS) to count th...
research
09/08/2019

Counting weighted independent sets beyond the permanent

In a landmark paper, Jerrum, Sinclair and Vigoda (2004) showed that the ...
research
01/12/2018

A fast new algorithm for weak graph regularity

We provide a deterministic algorithm that finds, in ϵ^-O(1) n^2 time, an...
research
06/04/2018

On Computing the Multiplicity of Short Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph

Counting short cycles in bipartite graphs is a fundamental problem of in...
research
05/27/2020

Parallel Load Balancing on Constrained Client-Server Topologies

We study parallel Load Balancing protocols for a client-server distribut...

Please sign up or login with your details

Forgot password? Click here to reset