Reducing the Ising model to matchings

Details Reducing the Ising model to matchings Reducing the Ising model to matchings

2009-07-02

arxiv.org/abs/0907.0477v1

Mathematics

Probability

19 pages, 5 figures

Scientific paper

Canonical paths is one of the most powerful tools available to show that a Markov chain is rapidly mixing, thereby enabling approximate sampling from complex high dimensional distributions. Two success stories for the canonical paths method are chains for drawing matchings in a graph, and a chain for a version of the Ising model called the subgraphs world. In this paper, it is shown that a subgraphs world draw can be obtained by taking a draw from matchings on a graph that is linear in the size of the original graph. This provides a partial answer to why canonical paths works so well for both problems, as well as providing a new source of algorithms for the Ising model. For instance, this new reduction immediately yields a fully polynomial time approximation scheme for the Ising model on a bounded degree graph when the magnitization is bounded away from 0.

Affiliated with

Also associated with

No associations

Rating

Reducing the Ising model to matchings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Reducing the Ising model to matchings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reducing the Ising model to matchings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-705024