Energy-decreasing dynamics in mean-field spin models

DOI10.1088/0305-4470/36/10/303zbMATH Open1022.82016arXivcond-mat/0210545OpenAlexW3100887412WikidataQ58295826 ScholiaQ58295826MaRDI QIDQ4807129FDOQ4807129

Authors: Luca Bussolari, P. Contucci, Mirko Degli Esposti, Cristian Giardinà 

Publication date: 2003

Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Abstract: We perform a statistical analysis of deterministic energy-decreasing algorithms on mean-field spin models with complex energy landscape like the Sine model and the Sherrington Kirkpatrick model. We specifically address the following question: in the search of low energy configurations is it convenient (and in which sense) a quick decrease along the gradient (greedy dynamics) or a slow decrease close to the level curves (reluctant dynamics)? Average time and wideness of the attraction basins are introduced for each algorithm together with an interpolation among the two and experimental results are presented for different system sizes. We found that while the reluctant algorithm performs better for a fixed number of trials, the two algorithms become basically equivalent for a given elapsed time due to the fact that the greedy has a shorter relaxation time which scales linearly with the system size compared to a quadratic dependence for the reluctant.

Full work available at URL: https://arxiv.org/abs/cond-mat/0210545

Recommendations

• FINDING MINIMA IN COMPLEX LANDSCAPES: ANNEALED, GREEDY AND RELUCTANT ALGORITHMS
• Recent results on the energy landscapes of mean field spin glasses
• Gradient descent dynamics in the mixed \(p\)-spin spherical model: finite-size simulations and comparison with mean-field integration
• Statistics of energy levels and zero temperature dynamics for deterministic spin models with glassy behaviour.
• On the energy minima of the Sherrington-Kirkpatrick model

zbMATH Keywords

statistical analysismean-field spin modelsdeterministic energy-decreasing algorithms

Mathematics Subject Classification ID

Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20)

Cited In (3)

• Analysis of adaptive walks on NK fitness landscapes with different interaction schemes
• Interpolating greedy and reluctant algorithms
• FINDING MINIMA IN COMPLEX LANDSCAPES: ANNEALED, GREEDY AND RELUCTANT ALGORITHMS

This page was built for publication: Energy-decreasing dynamics in mean-field spin models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4807129)