Related papers: Replica Monte Carlo Simulation (Revisited)
Population annealing Monte Carlo is an efficient sequential algorithm for simulating k-local Boolean Hamiltonians. Because of its structure, the algorithm is inherently parallel and therefore well suited for large-scale simulations of…
Extensive equilibrium Monte Carlo simulations are performed for a three-dimensional Heisenberg spin glass with the nearest-neighbor Gaussian coupling to investigate its spin-glass and chiral-glass orderings. The occurrence of a…
We show how to apply the absorbing Markov chain Monte Carlo algorithm of Novotny to simulate kinetically constrained models of glasses. We consider in detail one-spin facilitated models, such as the East model and its generalizations to…
An one-step replica-symmetry-breaking solution for finite connectivity spin-glass models with K body interaction is constructed at finite temperature using the replica method and thermodynamic constraints. In the absence of external fields,…
We study the efficiency of parallel tempering Monte Carlo technique for calculating true ground states of the Edwards-Anderson spin glass model. Bimodal and Gaussian bond distributions were considered in two and three-dimensional lattices.…
A general scheme for devising efficient cluster dynamics proposed in a previous letter [Phys.Rev.Lett. 72, 1541 (1994)] is extensively discussed. In particular the strong connection among equilibrium properties of clusters and dynamic…
Population Monte Carlo simulations in the form commonly referred to as population annealing can serve as a useful meta-algorithm for simulating systems with complex free-energy landscapes. In the present paper we provide an easily…
In this paper, we introduce a dynamical Monte Carlo algorithm for spin models in which the number of the spins fluctuates from zero to a given number by addition and deletion of spins with a probabilistic rule. Such simulations are realized…
We develop a parallel rejection algorithm to tackle the problem of low acceptance in Monte Carlo methods, and apply it to the simulation of the hopping conduction in Coulomb glasses using Graphics Processing Units, for which we also…
Monte Carlo simulations are widely employed to measure the physical properties of glass-forming liquids in thermal equilibrium. Combined with local Monte Carlo moves, the Metropolis algorithm can also be used to simulate the relaxation…
The aim of this work is to prove that it is possible to realise an optical system which produces as output a light intensity that can be expressed in the same mathematical form of the spin glass Hamiltonian. The optical system under study…
Monte Carlo simulation using the standard single-spin flip algorithm often fails to sample over the entire configuration space at low temperatures for frustrated spin systems. A typical example is a class of spin-ice type Ising models. In…
We present a nonlocal Monte Carlo algorithm with particle swaps that greatly accelerates thermalization of soft sphere binary mixtures in the glassy region. Our first results show that thermalization of systems of hundreds of particles is…
We study the 3D Edwards-Anderson model with binary interactions by Monte Carlo simulations. Direct evidence of finite-size scaling is provided, and the universal finite-size scaling functions are determined. Using an iterative extrapolation…
We present peapods (github.com/PeaBrane/peapods), an open-source Python package for Monte Carlo simulation of Ising spin systems with arbitrary coupling constants on periodic Bravais lattices with user-specified neighbor offsets. The…
The dynamics of a polydisperse model glassformer are investigated by augmenting molecular dynamics (MD) simulation with swap Monte Carlo (SMC). Three variants of the SMC algorithm are analyzed with regard to convergence and performance. We…
We study the correlation length of the two-dimensional Ising spin glass with a Gaussian distribution of interactions, using an efficient Monte Carlo algorithm proposed by Houdayer, that allows larger sizes and lower temperatures to be…
Equilibrium sampling of the configuration space in disordered systems requires algorithms that bypass the glassy slowing down of the physical dynamics. Irreversible Monte Carlo algorithms breaking detailed balance successfully accelerate…
In these two lectures I review our theoretical understanding of spin glasses paying a particular attention to the basic physical ideas. We introduce the replica method and we describe its probabilistic consequences (we stress the recently…
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…