Solving spin glasses with optimized trees of clustered spins

Solving spin glasses with optimized trees of clustered spins We present an algorithm for the optimization and thermal equilibration of spin glasses, or more generally, cost functions of the Ising form H=∑⟨ij⟩Jijsisj+∑ihisi, defined on graphs with arbitrary connectivity. The algorithm consists of two repeated steps: (i) the optimized construction of a random tree of spin clusters on the input problem graph, and (ii) the thermal sampling of the generated tree. The randomly generated trees are constructed so as to optimize a balance between the size of the tree and the complexity required to draw Boltzmann samples from it. We benchmark the algorithm on several classes of problems and demonstrate its advantages over existing approaches. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Physical Review E American Physical Society (APS)

Solving spin glasses with optimized trees of clustered spins

Preview Only

Solving spin glasses with optimized trees of clustered spins

Abstract

We present an algorithm for the optimization and thermal equilibration of spin glasses, or more generally, cost functions of the Ising form H=∑⟨ij⟩Jijsisj+∑ihisi, defined on graphs with arbitrary connectivity. The algorithm consists of two repeated steps: (i) the optimized construction of a random tree of spin clusters on the input problem graph, and (ii) the thermal sampling of the generated tree. The randomly generated trees are constructed so as to optimize a balance between the size of the tree and the complexity required to draw Boltzmann samples from it. We benchmark the algorithm on several classes of problems and demonstrate its advantages over existing approaches.
Loading next page...
 
/lp/aps_physical/solving-spin-glasses-with-optimized-trees-of-clustered-spins-Bxw2i9PNiJ
Publisher
The American Physical Society
Copyright
Copyright © ©2017 American Physical Society
ISSN
1539-3755
eISSN
550-2376
D.O.I.
10.1103/PhysRevE.96.022105
Publisher site
See Article on Publisher Site

Abstract

We present an algorithm for the optimization and thermal equilibration of spin glasses, or more generally, cost functions of the Ising form H=∑⟨ij⟩Jijsisj+∑ihisi, defined on graphs with arbitrary connectivity. The algorithm consists of two repeated steps: (i) the optimized construction of a random tree of spin clusters on the input problem graph, and (ii) the thermal sampling of the generated tree. The randomly generated trees are constructed so as to optimize a balance between the size of the tree and the complexity required to draw Boltzmann samples from it. We benchmark the algorithm on several classes of problems and demonstrate its advantages over existing approaches.

Journal

Physical Review EAmerican Physical Society (APS)

Published: Aug 2, 2017

There are no references for this article.

Sorry, we don’t have permission to share this article on DeepDyve,
but here are related articles that you can start reading right now:

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve Freelancer

DeepDyve Pro

Price
FREE
$49/month

$360/year
Save searches from
Google Scholar,
PubMed
Create lists to
organize your research
Export lists, citations
Read DeepDyve articles
Abstract access only
Unlimited access to over
18 million full-text articles
Print
20 pages/month
PDF Discount
20% off