Efficient subgraph-based sampling of Ising-type models with frustration

preprint2014arXivOpen access

Abstract

Here is proposed a general subgraph-based method for efficiently sampling certain graphical models, typically using subgraphs of a fixed treewidth, and also a related method for finding minimum energy (ground) states. In the case of models with frustration, such as the spin glass, evidence is presented that this method can be more efficient than traditional single-site update methods.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.