Related papers: Single-cluster dynamics for the random-cluster mod…
We propose a new effective cluster algorithm of tuning the critical point automatically, which is an extended version of Swendsen-Wang algorithm. We change the probability of connecting spins of the same type, $p = 1 - e^{- J/ k_BT}$, in…
We study the dynamic critical behavior of two algorithms: the Swendsen-Wang algorithm for the two-dimensional Potts model with q=2,3,4 and a Swendsen-Wang-type algorithm for the two-dimensional symmetric Ashkin-Teller model on the self-dual…
Inspired by the multicanonical approach to simulations of first-order phase transitions we propose for $q$-state Potts models a combination of cluster updates with reweighting of the bond configurations in the…
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 perform Monte Carlo simulations using the Wolff cluster algorithm of {\it multiple} $q=2,3,4$ state Potts models on dynamical phi-cubed graphs of spherical topology in order to investigate the $c>1$ region of two-dimensional quantum…
A Monte Carlo algorithm is proposed to simulate ferromagnetic q-state Potts model for any real q>0. A single update is a random sequence of disordering and deterministic moves, one for each link of the lattice. A disordering move attributes…
We study the dynamic critical behavior of the Chayes-Machta dynamics for the Fortuin-Kasteleyn random-cluster model, which generalizes the Swendsen-Wang dynamics for the q-state Potts model to noninteger q, in two and three spatial…
We study, via Monte Carlo simulation, the dynamic critical behavior of the Chayes-Machta dynamics for the Fortuin-Kasteleyn random-cluster model, which generalizes the Swendsen-Wang dynamics for the q-state Potts ferromagnet to non-integer…
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…
Monte Carlo algorithms, like the Swendsen-Wang and invaded-cluster, sample the Ising and Potts models asymptotically faster than single-spin Glauber dynamics do. Here, we generalize both algorithms to sample Potts lattice gauge theory by…
Inspired by the multicanonical approach to simulations of first-order phase transitions we propose for $q$-state Potts models a combination of cluster updates with reweighting of the bond configurations in the…
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…
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…
We present results of Monte Carlo simulations of random bond Potts models in two dimensions, for different numbers of Potts states, q. We introduce a simple scheme which yields continuous self-dual distributions of the interactions. As…
We perform Monte Carlo simulations using the Wolff cluster algorithm of the q=2 (Ising), 3, 4 and q=10 Potts models on dynamical phi-cubed graphs of spherical topology with up to 5000 nodes. We find that the measured critical exponents are…
We review the local Monte Carlo dynamics and Swendsen-Wang cluster algorithm. We introduce and analyze a new Monte Carlo dynamics known as transitional Monte Carlo. The transitional Monte Carlo algorithm samples energy probability…
The importance-sampling Monte Carlo algorithm appears to be the universally optimal solution to the problem of sampling the state space of statistical mechanical systems according to the relative importance of configurations for the…
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…
Many spin systems affected by critical slowing down can be efficiently simulated using cluster algorithms. Where such systems have long-range interactions, suitable formulations can additionally bring down the computational effort for each…
Dynamical behavior of the clusters during relaxation is studied in two-dimensional Potts model using cluster algorithm. Average cluster size and cluster formation velocity are calculated on two different lattice sizes for different number…