Related papers: Solving Spin Glasses with Optimized Trees of Clust…
Replica symmetry breaking postulates that near optima of spin glass Hamiltonians have an ultrametric structure. Namely, near optima can be associated to leaves of a tree, and the Euclidean distance between them corresponds to the distance…
We present and solve the Replica Symmetric equations in the context of the Replica Cluster Variational Method for the 2D random bond Ising model (including the 2D Edwards-Anderson spin glass model). First we solve a linearized version of…
We investigate an extended +-J Ising spin glass model by using a gauge symmetry. This model has +-J1 interactions and +-J2 interactions. We show that a gauge symmetry is usable to study this model. The exact internal energy, the rigorous…
Dilute dipolar Ising magnets remain a notoriously hard problem to tackle both analytically and numerically because of long-ranged interactions between spins as well as rare region effects. We study a new type of anisotropic dilute dipolar…
The sample-to-sample fluctuations of the free energy in finite-dimensional Ising spin glasses are calculated, using the replica method, from higher order terms in the replica number $n$. It is shown that the Parisi symmetry breaking scheme…
As spin glass materials have extremely slow dynamics, devious numerical methods are needed to study low-temperature states. A simple and fast optimization version of the classical Kasteleyn treatment of the Ising model is described and…
Optimizing a high-dimensional non-convex function is, in general, computationally hard and many problems of this type are hard to solve even approximately. Complexity theory characterizes the optimal approximation ratios achievable in…
A sketch of the chapter appearing under the same heading in the book ``New Optimization Algorithms in Physics'' (A.K. Hartmann and H. Rieger, Eds.) is given. After a general introduction to spin glasses, important aspects of heuristic…
An efficient algorithm is developed to construct disconnectivity graphs by a random walk over basins of attraction. This algorithm can detect a large number of local minima, find energy barriers between them, and estimate local thermal…
We devise a deterministic algorithm to efficiently sample high-quality solutions of certain spin-glass systems that encode hard optimization problems. We employ tensor networks to represent the Gibbs distribution of all possible…
Thermal cycling is an heuristic optimization algorithm which consists of cyclically heating and quenching by Metropolis and local search procedures, respectively, where the amplitude slowly decreases. In recent years, it has been…
The recently proposed Hysteretic Optimization (HO) procedure is applied to the 1D Ising spin chain with long range interactions. To study its effectiveness, the quality of ground state energies found as a function of the distance dependence…
A spin glass is a diluted magnetic material in which the magnetic moments are randomly interacting, with a huge number of metastable states which prevent reaching equilibrium. Spin-glass models are conceptually simple, but require very…
Due to an extremely rugged structure of the free energy landscape, the determination of spin-glass ground states is among the hardest known optimization problems, found to be NP-hard in the most general case. Owing to the specific structure…
We consider $h$-stable local optima of Ising spin glass models, defined as spin configurations such that for nearly all of the spins, flipping their values results in increasing energy by at least a given amount $h$. Spins satisfying this…
We introduce a hierarchical class of approximations of the random Ising spin glass in $d$ dimensions. The attention is focused on finite clusters of spins where the action of the rest of the system is properly taken into account. At the…
We present a continuous nonlinear optimization model for the Spin Glass Problem (SGP), building on a classical result by Rosenberg (1972), which shows that for a class of multilinear polynomial problems the optimal values of the continuous…
The \emph{Steiner tree} problem is one of the fundamental and classical problems in combinatorial optimization. In this paper, we study this problem in the $\mathcal{CONGESTED}$ $\mathcal{CLIQUE}$ model of distributed computing and present…
An approximate numerical approach to spin models is proposed, in which the original lattice is transformed into a tree. This method is applied to the Edwards-Anderson spin glass model in two and three dimensions. It captures the…
Many iterative and non-iterative methods have been developed for inverse problems associated with Ising models. Aiming to derive an accurate non-iterative method for the inverse problems, we employ the tree-reweighted approximation. Using…