Related papers: Single-cluster dynamics for the random-cluster mod…
We study analytically the relaxation eigenmodes of a simple Monte Carlo algorithm, corresponding to a particle in a box which moves by uniform random jumps. Moves outside of the box are rejected. At long times, the system approaches the…
We describe a number of recently developed cluster-flipping algorithms for the efficient simulation of classical spin models near their critical temperature. These include the algorithms of Wolff, Swendsen and Wang, and Niedermeyer, as well…
We study the dynamic critical behavior of a Swendsen--Wang--type algorithm for the Ashkin--Teller model. We find that the Li--Sokal bound on the autocorrelation time ($\tau_{{\rm int},{\cal E}} \ge {\rm const} \times C_H$) holds along the…
We study the dynamic critical behavior of the worm algorithm for the two- and three-dimensional Ising models, by Monte Carlo simulation. The autocorrelation functions exhibit an unusual three-time-scale behavior. As a practical matter, the…
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…
We propose a new quantum Monte Carlo algorithm which realizes a relaxation intrinsic to the original quantum system. The Monte Carlo dynamics satisfies the dynamic scaling relation $\tau\sim \xi^z$ and is independent of the Trotter number.…
We study the performance of a Wolff-type embedding algorithm for $RP^N$ $\sigma$-models. We find that the algorithm in which we update the embedded Ising model \`a la Swendsen-Wang has critical slowing-down as $z_\chi \approx 1$. If instead…
We investigate the dynamical critical behavior of the two-dimensional three-state Potts model with single spin-flip dynamics in equilibrium. We focus on the mean-squared deviation of the magnetization $M$ (MSD$_{M}$) as a function of time,…
We study the large-scale dynamics of event chain Monte Carlo algorithms in one dimension, and their relation to the true self-avoiding walk. In particular, we study the influence of stress, and different forms of interaction on the…
We apply the event-chain Monte Carlo algorithm to the three-dimensional ferromagnetic Heisenberg model. The algorithm is rejection-free and also realizes an irreversible Markov chain that satisfies global balance. The autocorrelation…
We study the dynamics of the q-state random bond Potts ferromagnet on the square lattice at its critical point by Monte Carlo simulations with single spin-flip dynamics. We concentrate on q=3 and q=24 and find, in both cases, conventional,…
We have simulated the three-dimensional Heisenberg model on simple cubic lattices, using the single-cluster Monte Carlo update algorithm. The expected pronounced reduction of critical slowing down at the phase transition is verified. This…
Given a set of variables and the correlations among them, we develop a method for finding clustering among the variables. The method takes advantage of information implicit in higher-order (not just pairwise) correlations. The idea is to…
The numerical simulation of strongly first-order phase transitions has remained a notoriously difficult problem even for classical systems due to the exponentially suppressed (thermal) equilibration in the vicinity of such a transition. In…
Nonequilibrium relaxation behaviors in the Ising model on a square lattice based on the Wolff algorithm are totally different from those based on local-update algorithms. In particular, the critical relaxation is described by the…
Recently, Velazquez and Curilef have proposed a methodology to extend Monte Carlo algorithms based on canonical ensemble, which is aimed to overcome slow sampling problems associated with temperature-driven discontinuous phase transitions.…
In this work we make a numerical study of the dynamic universality class of the Niedermayer algorithm applied to the two-dimensional Potts model with 2, 3, and 4 states. This algorithm updates clusters of spins and has a free parameter,…
We present numerical investigations of the short-time dynamics at criticality in the 1D Potts model with power-law decaying interactions of the form 1/r^{1+sigma}. The scaling properties of the magnetization, autocorrelation function and…
We present the algorithmic details of the dynamical cluster approximation (DCA) algorithm. The DCA is a fully-causal approach which systematically restores non-local correlations to the dynamical mean field approximation (DMFA). The DCA is…
We develop a recently proposed importance-sampling Monte Carlo algorithm for sampling rare events and quenched variables in random disordered systems. We apply it to a two dimensional bond-diluted Ising model and study the Griffiths…