• Register
PhysicsOverflow is a next-generation academic platform for physicists and astronomers, including a community peer review system and a postgraduate-level discussion forum analogous to MathOverflow.

Welcome to PhysicsOverflow! PhysicsOverflow is an open platform for community peer review and graduate-level Physics discussion.

Please help promote PhysicsOverflow ads elsewhere if you like it.


PO is now at the Physics Department of Bielefeld University!

New printer friendly PO pages!

Migration to Bielefeld University was successful!

Please vote for this year's PhysicsOverflow ads!

Please do help out in categorising submissions. Submit a paper to PhysicsOverflow!

... see more

Tools for paper authors

Submit paper
Claim Paper Authorship

Tools for SE users

Search User
Reclaim SE Account
Request Account Merger
Nativise imported posts
Claim post (deleted users)
Import SE post

Users whose questions have been imported from Physics Stack Exchange, Theoretical Physics Stack Exchange, or any other Stack Exchange site are kindly requested to reclaim their account and not to register as a new user.

Public \(\beta\) tools

Report a bug with a feature
Request a new functionality
404 page design
Send feedback


(propose a free ad)

Site Statistics

205 submissions , 163 unreviewed
5,064 questions , 2,215 unanswered
5,347 answers , 22,741 comments
1,470 users with positive rep
818 active unimported users
More ...

  Random bond Ising model and computational efficiency

+ 3 like - 0 dislike

If you want to find the ground state of the 2d random bond Ising model (no field), a computationally efficient algorithm exists to do it for you (based on minimum weight perfect matching). What about the thermal state for some finite temperature, T? Is there an efficient (i.e. time scales polynomially with system size) way to sample states of different spin configurations from this distribution?

This post has been migrated from (A51.SE)
asked Jan 26, 2012 in Theoretical Physics by James (125 points) [ no revision ]

1 Answer

+ 2 like - 0 dislike

The divide between tractable and intractable was shown by Sorin Istrail to be between planar and non-planar graphs. Since 2D surfaces can have non-planar graphs imbedded in them I think (correct me if I'm wrong) planar RBIMs are what you want to look at.

That said, Istrail showed that for {-J,0,J} couplings the ground state as well as the partition function can be efficiently calculated. I'm not sure of the exact details, but the calculation of the partition function can be mapped to the calculation of the determinant which is efficient. The specifics are available as references in the paper below.

Istrail's Paper: http://www.cs.brown.edu/people/sorin/pdfs/Ising-paper.pdf

This post has been migrated from (A51.SE)
answered Jan 27, 2012 by jonas (80 points) [ no revision ]
The basic result, i.e.: that obtaining the random-bond-Ising GS for non-planar lattices is NP-complete, was proved by Barahona in 1982. www.yaroslavvb.com/papers/barahona-on.pdf

This post has been migrated from (A51.SE)

Your answer

Please use answers only to (at least partly) answer questions. To comment, discuss, or ask for clarification, leave a comment instead.
To mask links under text, please type your text, highlight it, and click the "link" button. You can then enter your link URL.
Please consult the FAQ for as to how to format your post.
This is the answer box; if you want to write a comment instead, please use the 'add comment' button.
Live preview (may slow down editor)   Preview
Your name to display (optional):
Privacy: Your email address will only be used for sending these notifications.
Anti-spam verification:
If you are a human please identify the position of the character covered by the symbol $\varnothing$ in the following word:
Then drag the red bullet below over the corresponding character of our banner. When you drop it there, the bullet changes to green (on slow internet connections after a few seconds).
Please complete the anti-spam verification

user contributions licensed under cc by-sa 3.0 with attribution required

Your rights