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

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 an...

Full description

Bibliographic Details

Published in:	Combinatorics, probability & computing Vol. 30; no. 6; pp. 905 - 921
Main Authors:	Dyer, Martin, Heinrich, Marc, Jerrum, Mark, Müller, Haiko
Format:	Journal Article
Language:	English
Published:	Cambridge Cambridge University Press 01.11.2021
Subjects:	Algorithms Antiferromagnetism Approximation Combinatorics Graphs Ising model Kagome lattice Markov chains Mathematical analysis Partitions (mathematics) Polynomials
ISSN:	0963-5483, 1469-2163
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!