Spin glasses and algorithm benchmarks: A one-dimensional view
Abstract
Spin glasses are paradigmatic models that deliver concepts relevant for a variety of systems. However, rigorous analytical results are difficult to obtain for spin-glass models, in particular for realistic short-range models. Therefore large-scale numerical simulations are the tool of choice. Concepts and algorithms derived from the study of spin glasses have been applied to diverse fields in computer science and physics. In this work a one-dimensional long-range spin-glass model with power-law interactions is discussed. The model has the advantage over conventional systems in that by tuning the power-law exponent of the interactions the effective space dimension can be changed thus effectively allowing the study of large high-dimensional spin-glass systems to address questions as diverse as the existence of an Almeida-Thouless line, ultrametricity and chaos in short range spin glasses. Furthermore, because the range of interactions can be changed, the model is a formidable test-bed for optimization algorithms.
Keywords
Cite
@article{arxiv.0711.1532,
title = {Spin glasses and algorithm benchmarks: A one-dimensional view},
author = {Helmut G. Katzgraber},
journal= {arXiv preprint arXiv:0711.1532},
year = {2008}
}
Comments
10 pages, 8 figures (two in crappy quality due to archive restrictions). Proceedings of the International Workshop on Statistical-Mechanical Informatics 2007, Kyoto (Japan) September 16-19, 2007