Related papers: Efficient Cluster Algorithm for Spin Glasses in An…
The study of spin systems with disorder and frustration is known to be a computationally hard task. Standard heuristics developed for optimizing and sampling from general Ising Hamiltonians tend to produce correlated solutions due to their…
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 frustrated Ising model in two dimensions is revisited. The frustration is quantified in terms of the number of non-trivial plaquettes which is invariant under the Nishimori gauge symmetry. The exact ground state energy is calculated…
We propose a computational methodology based on a hierarchical cluster growth process to solve spin-3/2 Ising models efficiently. The method circumvents the exponential complexity (\(4^{N}\)) of the canonical ensemble partition function by…
Glassy behavior is one of the main open problems in condensed matter physics. In this thesis, we approach the problem by studying spin-glasses and colloids, using several complementary strategies. From the point of view of model building,…
We present an algorithm for the simulation of three-dimensional spin glasses deep in the low-temperature phase: Parallel Tempering enhanced with Houdayer moves and with an entropic reservoir (PTHR). Although differences with the standard…
We present an algorithm for the optimization and thermal equilibration of spin glasses - or more generally, cost functions of the Ising form $H=\sum_{\langle i j\rangle} J_{ij} s_i s_j + \sum_i h_i s_i$, defined on graphs with arbitrary…
Finding the ground state of Ising spin glasses is notoriously difficult due to disorder and frustration. Often, this challenge is framed as a combinatorial optimization problem, for which a common strategy employs simulated annealing, a…
A new Monte Carlo algorithm for 2-dimensional spin glasses is presented. The use of clusters makes possible global updates and leads to a gain in speed of several orders of magnitude. As an example, we study the 2-dimensional +/-J…
A worm algorithm is proposed for the two-dimensional spin glasses. The method is based on a low-temperature expansion of the partition function. The low-temperature configurations of the spin glass on square lattice can be viewed as strings…
In this work, we theoretically demonstrate that a strong enhancement of the Magnetocaloric Effect is achieved in geometrically frustrated cluster spin-glass systems just above the freezing temperature. We consider a network of clusters…
Spin glasses featured by frustrated interactions and metastable states have important applications in chemistry, material sciences and artificial neural networks. However, the solution of the spin glass models is hindered by the…
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 review several parallel tempering schemes and examine their main ingredients for accuracy and efficiency. The present study covers two selection methods of temperatures and several choices for the exchange of replicas, including a recent…
In this paper, we present a cluster algorithm for the simulation of hard spheres and related systems. In this algorithm, a copy of the configuration is rotated with respect to a randomly chosen pivot point. The two systems are then…
Suitable cluster definitions have allowed researchers to describe many ordering transitions in spin systems as geometric phenomena related to percolation. For spin glasses and some other systems with quenched disorder, however, such a…
Spin glasses are notoriously difficult to study both analytically and numerically due to the presence of frustration and metastability. Their highly non-convex landscapes require collective updates to explore efficiently. Currently, most…
A sampling algorithm is presented that generates spin glass configurations of the 2D Edwards-Anderson Ising spin glass at finite temperature, with probabilities proportional to their Boltzmann weights. Such an algorithm overcomes the slow…
We present an algorithm which calculates groundstates of Ising spin glasses approximately. It works by randomly selecting clusters of spins which exhibit no frustrations. The spins which were not selected, contribute to the local fields of…
A quantum-thermal annealing method using a cluster-flip algorithm is studied in the two-dimensional spin-glass model. The temperature (T) and the transverse field (Gamma) are decreased simultaneously with the same rate along a linear path…