Log In Sign Up

Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs

by   Martin Dyer, et al.

We present a polynomial-time Markov chain Monte Carlo algorithm for estimating the partition function of the antiferromagnetic Ising model on any line graph. The analysis of the algorithm exploits the "winding" technology devised by McQuillan [CoRR abs/1301.2880 (2013)] and developed by Huang, Lu and Zhang [Proc. 27th Symp. on Disc. Algorithms (SODA16), 514-527]. We show that exact computation of the partition function is #P-hard, even for line graphs, indicating that an approximation algorithm is the best that can be expected. We also show that Glauber dynamics for the Ising model is rapidly mixing on line graphs, an example being the kagome lattice.


page 1

page 2

page 3

page 4


Approximating Partition Functions in Constant Time

We study approximations of the partition function of dense graphical mod...

A deterministic algorithm for counting colorings with 2Δ colors

We give a polynomial time deterministic approximation algorithm (an FPTA...

Efficient sampling from the Bingham distribution

We give a algorithm for exact sampling from the Bingham distribution p(x...

Polymer Dynamics via Cliques: New Conditions for Approximations

Abstract polymer models are systems of weighted objects, called polymers...

Spectral Independence via Stability and Applications to Holant-Type Problems

This paper formalizes connections between stability of polynomials and c...

FPRAS Approximation of the Matrix Permanent in Practice

The matrix permanent belongs to the complexity class #P-Complete. It is ...

Wiener filters on graphs and distributed polynomial approximation algorithms

In this paper, we consider Wiener filters to reconstruct deterministic a...