A polynomial-time algorithm for estimating the partition function of the ferromagnetic Ising model on a regular matroid

We investigate the computational difficulty of approximating the partition function of the ferromagnetic Ising model on a regular matroid. Jerrum and Sinclair have shown that there is a fully polynomial randomised approximation scheme (FPRAS) for the class of graphic matroids. On the other hand, the...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org
Main Authors: Goldberg, Leslie Ann, Jerrum, Mark
Format: Paper
Language:English
Published: Ithaca Cornell University Library, arXiv.org 22.04.2013
Subjects:
Algorithms
Approximation
Ferromagnetism
Ising model
Mathematical analysis
Partitions
Partitions (mathematics)
Polynomials
ISSN:2331-8422
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We investigate the computational difficulty of approximating the partition function of the ferromagnetic Ising model on a regular matroid. Jerrum and Sinclair have shown that there is a fully polynomial randomised approximation scheme (FPRAS) for the class of graphic matroids. On the other hand, the authors have previously shown, subject to a complexity-theoretic assumption, that there is no FPRAS for the class of binary matroids, which is a proper superset of the class of graphic matroids. In order to map out the region where approximation is feasible, we focus on the class of regular matroids, an important class of matroids which properly includes the class of graphic matroids, and is properly included in the class of binary matroids. Using Seymour's decomposition theorem, we give an FPRAS for the class of regular matroids.
Bibliography:SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
ISSN:2331-8422
DOI:10.48550/arxiv.1010.6231