Related papers: A Worm Algorithm for Two-Dimensional Spin Glasses
The Prokof'ev Svistunov worm algorithm was originally developed for models with nearest neighbor interactions that in a high temperature expansion are mapped to systems of closed loops. In this work we present the surface worm algorithm…
We propose an efficient Monte Carlo algorithm for simulating a ``hardly-relaxing" system, in which many replicas with different temperatures are simultaneously simulated and a virtual process exchanging configurations of these replica is…
Consider a swarm of particles controlled by global inputs. This paper presents algorithms for shaping such swarms in 2D using boundary walls. The range of configurations created by conforming a swarm to a boundary wall is limited. We…
We review some recent results on finite dimensional spin glasses by studying recent numerical simulations and their relationship with experiments. In particular we will show results obtained at zero and non zero temperature, focusing in the…
We establish an efficient approximation algorithm for the partition functions of a class of quantum spin systems at low temperature, which can be viewed as stable quantum perturbations of classical spin systems. Our algorithm is based on…
We demonstrate numerically that for Ising spins on square lattices with ferromagnetic second neighbour interactions and random near neighbour interactions, two dimensional Ising spin glass order with a non-zero freezing temperature can…
In 1986, Swendsen and Wang proposed a replica Monte Carlo algorithm for spin glasses [Phys. Rev. Lett. 57 (1986) 2607]. Two important ingredients are present, (1) the use of a collection of systems (replicas) at different of temperatures,…
This paper develops approximate message passing algorithms to optimize multi-species spherical spin glasses. We first show how to efficiently achieve the algorithmic threshold energy identified in our companion work, thus confirming that…
Recently a cluster Monte Carlo algorithm has been used very successfully in the two-dimensional Edwards-Anderson (EA) model. We show that this algorithm and a variant thereof can also be used successfully in models with a non-zero spin…
We extend to soft repulsive interaction potentials a recently proposed irreversible swap algorithm originally designed for polydisperse hard spheres. The original algorithm performs rejection-free, irreversible, collective swap moves. We…
Aging in spin glasses (and in some other systems) reveals astonishing effects of `rejuvenation and memory' upon temperature changes. In this paper, we propose microscopic mechanisms (at the scale of spin-spin interactions) which can be at…
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…
We show that by displacing two optical lattices with respect to each other, we may produce interactions similar to the ones describing ferro-magnetism in condensed matter physics. We also show that particularly simple choices of the…
We discuss convergence and coupling of Markov chains, and present general relations between the transfer matrices describing these two processes. We then analyze a recently developed local-patch algorithm, which computes rigorous upper…
A new approach to exploring low-temperature excitations in finite-dimensional lattice spin glasses is proposed. By focusing on bond-diluted lattices just above the percolation threshold, large system sizes $L$ can be obtained which lead to…
The two-dimensional Ising model is studied by performing computer simulations with one of the Monte Carlo algorithms - the worm algorithm. The critical temperature T_C of the phase transition is calculated by the usage of the critical…
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 discuss the implementation of a directed geometrical worm algorithm for the study of quantum link-current models. In this algorithm Monte Carlo updates are made through the biased reptation of a worm through the lattice. A directed…
Worm algorithms have been very successful with the simulation of sigma models with fixed length spins which result from scalar field theories in the limit of infinite quartic coupling lambda. Here we investigate closer their algorithmic…
We discuss a rejectionless global optimization technique which, while being technically similar to the recently introduced method of Extremal Optimization, still relies on a physical analogy with a thermalizing system. Our waiting time…