Related papers: Numerical simulation study of the dynamical behavi…
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,…
Monte Carlo cluster algorithms are popular for their efficiency in studying the Ising model near its critical temperature. We might expect that this efficiency extends to the bond-diluted Ising model. We show, however, that this is not…
We present the results of Monte Carlo simulations for the critical dynamics of the three-dimensional site-diluted quenched Ising model. Three different dynamics are considered, these correspond to the local update Metropolis scheme as well…
In this work we have calculated the dynamic critical exponent $z$ for 2-, 3- and 4-dimensional Ising models using the Wolff's algorithm through dynamic finite size scaling. We have studied time evolution of the average cluster size, the…
In this work we have studied the dynamic scaling behavior of two scaling functions and we have shown that scaling functions obey the dynamic finite size scaling rules. Dynamic finite size scaling of scaling functions opens possibilities for…
We investigate the spatial overlap of successive spin configurations in Markov chain Monte Carlo simulations using the local Metropolis algorithm and the Swendsen-Wang and Wolff cluster algorithms. We examine the dynamics of these…
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 we reported some interesting features of the Wolff's algorithm behavior when applied to the site-bond-correlated Ising model.Our main results were that a stronger correlation diminishes the autocorrelation time but it does not…
Two cluster algorithms, based on constructing and flipping loops, are presented for worldline quantum Monte Carlo simulations of fermions and are tested on the one-dimensional repulsive Hubbard model. We call these algorithms the loop-flip…
We extend the Wolff algorithm to include correlated spin interactions in diluted magnetic systems. This algorithm is applied to study the site-bond-correlated Ising model on a two dimensional square lattice. We use a finite size scaling…
For the 2D Ising model, we analyzed dependences of thermodynamic characteristics on number of spins by means of computer simulations. We compared experimental data obtained using the Fisher-Kasteleyn algorithm on a square lattice with…
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 simulate single and multiple Ising models coupled to 2-d gravity using both the Swendsen-Wang and Wolff algorithms to update the spins. We study the integrated autocorrelation time and find that there is considerable critical slowing…
Monte Carlo simulations of the 1D Ising model with ferromagnetic interactions decaying with distance $r$ as $1/r^{1+\sigma}$ are performed by applying the Swendsen-Wang cluster algorithm with cumulative probabilities. The critical behavior…
With a nonequilibrium relaxation method, we calculate the dynamic critical exponent z of the two-dimensional Ising model for the Swendsen-Wang and Wolff algorithms. We examine dynamic relaxation processes following a quench from a…
We study the scaling properties of the clusters grown by the Wolff algorithm on seven different Sierpinski-type fractals of Hausdorff dimension $1 < d_f \le 3$ in the framework of the Ising model. The mean absolute value of the surface…
We apply a new updating algorithm scheme to investigate the critical behavior of the two-dimensional ferromagnetic Ising model on a triangular lattice with nearest neighbour interactions. The transition is examined by generating accurate…
The dynamic behavior of cluster algorithms is analyzed in the classical mean field limit. Rigorous analytical results below $T_c$ establish that the dynamic exponent has the value $z_{sw}=1$ for the Swendsen-Wang algorithm and $z_{uw}=0$…
We present a fast, hierarchical, and adaptive algorithm for Metropolis Monte Carlo simulations of systems with long-range interactions that reproduces the dynamics of a standard implementation exactly, i.e., the generated configurations and…
We report the results of simulations of the Lebwohl-Lasher model of the nematic-isotropic transition using a new cluster Monte Carlo algorithm. The algorithm is a modification of the Wolff algorithm for spin systems, and greatly reduces…