Optimisation problems and replica symmetry breaking in finite connectivity spin-glasses
Remi Monasson
Abstract
A formalism capable of handling the first step of hierarchical replica symmetry breaking in finite-connectivity models is introduced. The emerging order parameter is claimed to be a probability distribution over the space of field distributions (or, equivalently magnetisation distributions) inside the cluster of states. The approach is shown to coincide with the previous works in the replica symmetric case and in the two limit cases m=0,1 where m is Parisi's break-point. As an application to the study of optimization problems, the ground-state properties of the random 3-Satisfiability problem are investigated and we present a first RSB solution improving replica symmetric results.
Create a lesson
Related papers
On physical implementability of reinforcement-learning-driven reasoning
Eiji Konishi
The Stone-Wales trefoil: a new topological defect in graphene
M. V. Kondrin, Y. B. Lebed, V. V. Brazhkin
Short-Range Vector Spin Glasses: Parisi Hierarchies and Real-Space Ultrametricity
Akash Vijay, Jaewon Kim, Jong Yeon Lee
Lyapunov spectrum of random neural networks
David G. Clark
Revealing more on complex energy landscapes by passing less local information: Cavity approach with trust region in non-convex optimization problems
Zhiqi Xu, Chi Ho Yeung
Predicting activation-barrier and plasticity-onset statistics in a model of glasses
Makoto Suda, Edan Lerner, Eran Bouchbinder