Related papers: Replica-Exchange Cluster Algorithm
The Widom-Rowlinson model of a fluid mixture is studied using a new cluster algorithm that is a generalization of the invaded cluster algorithm previously applied to Potts models. Our estimate of the critical exponents for the two-component…
We propose a new Monte Carlo method for efficiently sampling trajectories with fixed initial and final conditions in a system with discrete degrees of freedom. The method can be applied to any stochastic process with local interactions,…
Monte Carlo simulations have boosted the numerical study of several different physical systems and in particular, the canonical ensemble has been especially useful because of the existence of easy and efficient relaxation algorithms…
We present a generalization of the classical Wang-Landau algorithm [Phys. Rev. Lett. 86, 2050 (2001)] to quantum systems. The algorithm proceeds by stochastically evaluating the coefficients of a high temperature series expansion or a…
We propose an algorithm to obtain numerically approximate solutions of the direct Ising problem, that is, to compute the free energy and the equilibrium observables of spin systems with arbitrary two-spin interactions. To this purpose we…
The development of new algorithms for simulations in physics is as important as the development of new analytical methods. In this paper, we present a comparison of the recently developed microcanonical population annealing (MCPA) algorithm…
We review efficient Monte Carlo methods for simulating quantum systems which couple to a dissipative environment. A brief introduction of the Caldeira-Leggett model and the Monte Carlo method will be followed by a detailed discussion of…
We present a quantum Monte Carlo investigation of the finite-temperature phase diagram of the quantum dimer model on the square lattice. We use the sweeping cluster algorithm, which allows to implement exactly the dimer constraint,…
Sequential Monte Carlo algorithms, or Particle Filters, are Bayesian filtering algorithms which propagate in time a discrete and random approximation of the a posteriori distribution of interest. Such algorithms are based on Importance…
We modified the recently proposed multicanonical MC algorithm for the case of a magnetic field driven order--order phase transition. We test this {\it multimagnetic} Monte Carlo algorithm for the D=2 Ising model at $\beta=0.5$ and simulate…
We study the two-dimensional classical XY model by the large-scale Monte Carlo simulation of the Swendsen-Wang multi-cluster algorithm using multiple GPUs on the open science supercomputer TSUBAME 2.0. Simulating systems up to the linear…
The one-dimensional kinetic contact process with parallel update is introduced and studied by Monte Carlo simulations. This process is proposed to describe the plant population replication and epidemic disease spreading among them. The…
Binary magnetic square lattice Ising system with nearest neighbour interactions were simulated using the Monte Carlo technique. Two types of ions were randomly distributed on the lattice sites, one type interacting ferromagnetic and the…
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 critical behaviour of the randomly spin-diluted Ising model in two space dimensions is investigated by a new method which combines a grand ensemble approach to disordered systems proposed by Morita with the phenomenological…
We present an efficient and exact Monte Carlo algorithm to simulate reversible aggregation of particles with dedicated binding sites. This method introduces a novel data structure of dynamic bond tree to record clusters and sequences of…
A Microcanonical Finite Site Ansatz in terms of quantities measurable in a Finite Lattice allows to extend phenomenological renormalization (the so called quotients method) to the microcanonical ensemble. The Ansatz is tested numerically in…
In this paper a variant of the classical hierarchical cluster analysis is reported. This agglomerative (bottom-up) cluster technique is referred to as the Adaptive Mean-Linkage Algorithm. It can be interpreted as a linkage algorithm where…
We investigate nonequilibrium relaxations of Ising models at the critical point by using a cluster update. While preceding studies imply that nonequilibrium cluster-flip dynamics at the critical point are universally described by the…
We present an extensive analysis of systematic deviations in Wolff cluster simulations of the critical Ising model, using random numbers generated by binary shift registers. We investigate how these deviations depend on the lattice size,…