Local minima in disordered mean-field ferromagnets

DOI10.1007/S10955-019-02480-4MaRDI QIDQ2194169zbMATHOpenAlexWikidataFDO

Authors E. Y. Song, Reza Gheissari, Charles M. Newman, Daniel L. Stein

Publication date 25 August 2020

Published in Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1910.11862

zbMATH Keywords

constrained optimizationquenched disorderlocal energy minimacomplex landscapesdisordered ferromagnetsdynamics in dilute Curie-Weiss modelslandscape search algorithmslocal MINCUTmean-field ferromagnetsmetastable traps

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Random graphs (graph-theoretic aspects) (05C80) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44) Statistical mechanics of random media, disordered materials (including liquid crystals and spin glasses) (82D30) Statistical mechanics of magnetic materials (82D40)

Abstract: We consider the complexity of random ferromagnetic landscapes on the hypercube ${pm1}^N$ given by Ising models on the complete graph with i.i.d. non-negative edge-weights. This includes, in particular, the case of Bernoulli disorder corresponding to the Ising model on a dense random graph $mathcalG(N,p)$. Previous results had shown that, with high probability as $Noinfty$, the gradient search (energy-lowering) algorithm, initialized uniformly at random, converges to one of the homogeneous global minima (all-plus or all-minus). Here, we devise two modified algorithms tailored to explore the landscape at near-zero magnetizations (where the effect of the ferromagnetic drift is minimized). With these, we numerically verify the landscape complexity of random ferromagnets, finding a diverging number of (1-spin-flip-stable) local minima as $Noinfty$. We then investigate some of the properties of these local minima (e.g., typical energy and magnetization) and compare to the situation where the edge-weights are drawn from a heavy-tailed distribution.

Recommendations

• Zero-temperature dynamics for the ferromagnetic Ising model on random graphs
• FINDING MINIMA IN COMPLEX LANDSCAPES: ANNEALED, GREEDY AND RELUCTANT ALGORITHMS
• Landscape statistics of thep-spin Ising model
• Zero-temperature dynamics in the dilute Curie-Weiss model
• Nature versus nurture: dynamical evolution in disordered Ising ferromagnets

Cites work

• scientific article; zbMATH DE number 1452975 (Why is no real title available?)
• Algorithmic thresholds for tensor PCA
• Complexity of random smooth functions on the high-dimensional sphere
• Extremal cuts of sparse random graphs
• Local max-cut in smoothed polynomial time
• Local optima of the Sherrington-Kirkpatrick Hamiltonian
• Nature versus nurture: dynamical evolution in disordered Ising ferromagnets
• Proof of the satisfiability conjecture for large \(k\)
• Random matrices and complexity of spin glasses
• Satisfiability threshold for random regular \textsc{nae-sat}
• The complexity of spherical \(p\)-spin models: a second moment approach
• The landscape of the spiked tensor model
• Time-Dependent Statistics of the Ising Model
• Zero-temperature dynamics in the dilute Curie-Weiss model

Cited in

(6)

• Partitioning problems via random processes
• Phase transition in a random minima model: mean field theory and exact solution on the Bethe lattice
• Friendly bisections of random graphs
• Local order at arbitrary distances in finite-dimensional spin-glass models
• Local field distributions in spin glasses
• The global minimum of energy is not always a sum of local minima -- A note on frustration

This page was built for publication: Local minima in disordered mean-field ferromagnets

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