Related papers: Cluster Hybrid Monte Carlo Simulation Algorithms
We present an algorithmic framework for a variant of the quantum Monte Carlo operator-loop algorithm, where non-local cluster updates are constructed in a way that makes each individual loop smaller. The algorithm is designed to increase…
We present an optimized version of a cluster labeling algorithm previously introduced by the authors. This algorithm is well suited for large-scale Monte Carlo simulations of spin models using cluster dynamics on parallel computers with…
We present a progress report on the Cluster Processor, a special-purpose computer system for the Wolff simulation of the three-dimensional Ising model, including an analysis of simulation results obtained thus far. These results allow,…
We present an efficient Monte Carlo algorithm for the simulation of the two-dimensional Random Field Ising Model (RFIM). The method combines the event-driven, rejection-free character of the Bortz Kalos-Lebowitz (BKL) algorithm with Glauber…
The two-dimensional spin-1 Baxter-Wu model is studied by using Monte Carlo simulations. The standard single-spin-flip Metropolis algorithm is used to generate the configurations from which the order parameter, specific heat and magnetic…
We have developed an efficient Monte Carlo algorithm, which accelerates slow Monte Carlo dynamics in quasi-one-dimensional Ising spin systems. The loop algorithm of the quantum Monte Carlo method is applied to the classical spin models with…
An efficient Monte Carlo algorithm for the simulation of spin models with long-range interactions is discussed. Its central feature is that the number of operations required to flip a spin is independent of the number of interactions…
The physics of crystalline membranes, i.e. fixed-connectivity surfaces embedded in three dimensions and with an extrinsic curvature term, is very rich and of great theoretical interest. To understand their behavior, numerical simulations…
We study the performance of Monte Carlo simulations that sample a broad histogram in energy by determining the mean first-passage time to span the entire energy space of d-dimensional ferromagnetic Ising/Potts models. We first show that…
We demonstrate that a series of procedures for increasing the efficiency of transition matrix calculations can be realized by integrating the standard single-spin flip transition matrix method with global cluster flipping techniques. Our…
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…
We use the single-cluster Monte Carlo update algorithm to simulate the Ising model on two-dimensional Poissonian random lattices with up to 80,000 sites which are linked together according to the Voronoi/Delaunay prescription. In one set of…
In finite-size scaling analyses of Monte Carlo simulations of second-order phase transitions one often needs an extended temperature/energy range around the critical point. By combining the replica-exchange algorithm with cluster updates…
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…
The Ising model is a simple statistical model for ferromagnetism. There are analytic solutions for low dimensions and very efficient Monte Carlo methods, such as cluster algorithms, for simulating this model in special cases. However most…
In this paper we study the Metropolis algorithm in connection with two mean--field spin systems, the so called mean--field Ising model and the Blume--Emery--Griffiths model. In both this examples the naive choice of proposal chain gives…
We introduce a Metropolis-Hastings Markov chain for Boltzmann distributions of classical spin systems. It relies on approximate tensor network contractions to propose correlated collective updates at each step of the evolution. We present…
To minimise systematic errors in Monte Carlo simulations of charged particles, long range electrostatic interactions have to be calculated accurately and efficiently. Standard approaches, such as Ewald summation or the naive application of…
Coulomb and log-gases are exchangeable singular Boltzmann-Gibbs measures appearing in mathematical physics at many places, in particular in random matrix theory. We explore experimentally an efficient numerical method for simulating such…
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…