Related papers: Event-chain Monte Carlo for classical continuous s…
A driven Monte Carlo dynamics is introduced to study resistivity scaling in XY-type models in the phase representation. The method is used to study the phase transition of the three-dimensional XY spin glass with a Gaussian coupling…
We consider Monte Carlo algorithms for the simulation of charged lattice gases with purely local dynamics. We study the mobility of particles as a function of temperature and show that the poor mobility of particles at low temperatures is…
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 propose a generalization of the Quantum Monte Carlo loop algorithm to the t-J model by a mapping to three coupled six-vertex models. The autocorrelation times are reduced by orders of magnitude compared to the conventional local…
A sampling method for spin systems is presented. The spin lattice is written as the union of a nested sequence of sublattices, all but the last with conditionally independent spins, which are sampled in succession using their marginals. The…
We apply a meron cluster algorithm to the XY spin chain, which describes a quantum rotor. This is a multi-cluster simulation supplemented by an improved estimator, which deals with objects of half-integer topological charge. This method is…
Mean field-like approximations (including naive mean field, Bethe and Kikuchi and more general Cluster Variational Methods) are known to stabilize ordered phases at temperatures higher than the thermodynamical transition. For example, in…
Monte Carlo (MC) simulations of lattice models are a widely used way to compute thermodynamic properties of substitutional alloys. A limitation to their more widespread use is the difficulty of driving a MC simulation in order to obtain the…
We report results for simulations of the four-dimensional XY spin glass using the parallel tempering Monte Carlo method at low temperatures for moderate sizes. Our results are qualitatively consistent with earlier work on the…
We propose a number of Monte Carlo algorithms for the simulation of ice models and compare their efficiency. One of them, a cluster algorithm for the equivalent three colour model, appears to have a dynamic exponent close to zero, making it…
We propose a fast and general predecision scheme for Metropolis Monte Carlo simulation of $d$-dimensional long-range interacting lattice models. For potentials of the form $V(r)=r^{-d-\sigma}$, this reduces the computational complexity from…
We present cluster Monte Carlo algorithms for the $XYZ$ quantum spin models. In the special case of $S=1/2$, the new algorithm can be viewed as a cluster algorithm for the 8-vertex model. As an example, we study the $S=1/2$ $XY$ model in…
We implement a cluster-update Monte Carlo algorithm to simulate magnetic dipoles of the XY-spin type confined in a two-dimensional plane. The long-range character and anisotropy in the dipole interaction are handled by using the…
The swap Monte Carlo algorithm introduces non-physical dynamic rules to accelerate the exploration of the configuration space of supercooled liquids. Its success raises deep questions regarding the nature and physical origin of the slow…
The swap Monte Carlo algorithm combines the translational motion with the exchange of particle species, and is unprecedentedly efficient for some models of glass former. In order to clarify the physics underlying this acceleration, we study…
We present an algorithm for Monte Carlo simulations of a nearest-neighbor spin ice model based on its cluster representation. To assess its performance, we estimate a relaxation time, and find that, in contrast to the Metropolis algorithm,…
A Monte Carlo event generator has been developed assuming thermal production of hadrons. The system under consideration is sampled grand canonically in the Boltzmann approximation. A re-weighting scheme is then introduced to account for…
We present a new Monte Carlo algorithm for studying site or bond percolation on any lattice. The algorithm allows us to calculate quantities such as the cluster size distribution or spanning probability over the entire range of site or bond…
We review Sweeny's algorithm for Monte Carlo simulations of the random cluster model. Straightforward implementations suffer from the problem of computational critical slowing down, where the computational effort per edge operation scales…
It has recently been shown that the computing abilities of Boltzmann machines, or Ising spin-glass models, can be implemented by chaotic billiard dynamics without any use of random numbers. In this paper, we further numerically investigate…