相关论文: Critical Slowing Down of Cluster Algorithms for Is…

Wang-Landau simulations offer the possibility to integrate explicitly over a collective coordinate and stochastically over the remainder of configuration space. We propose to choose the so-called "slow mode", which is responsible for large…

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…

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 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…

Combinatorial optimization algorithms which compute exact ground state configurations in disordered magnets are seen to exhibit critical slowing down at zero temperature phase transitions. Using arguments based on the physical picture of…

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…

When simulating a lattice system near its critical temperature, local algorithms for modeling the system's evolution can introduce very large autocorrelation times into sampled data. This critical slowing down places restrictions on the…

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…

We present a self consistent method based on cluster algorithms and Renormalization Group on the lattice to study critical systems numerically. We illustrate it by means of the 2D Ising model. We compute the critical exponents $\nu$ and…

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 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…

In this paper we propose a novel method to study critical systems numerically by a combined collective-mode algorithm and Renormalization Group on the lattice. This method is an improved version of MCRG in the sense that it has all the…

We show that the mixing time of Glauber (single edge update) dynamics for the random cluster model at $q=2$ is bounded by a polynomial in the size of the underlying graph. As a consequence, the Swendsen-Wang algorithm for the ferromagnetic…

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 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,…

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…

We perform numerical simulations to study static and dynamic critical behaviour of the 3d random-site Ising model. A distinct feature of our approach is a combination of the Metropolis, Swendsen-Wang, and Wolff Monte Carlo algorithms. For…

The Fortuin-Kasteleyn mapping between the Ising model and the site-bond correlated percolation model is shown to be only one of an infinite class of exact mappings. These new cluster representations are a result of "renormalized"…

Using D-theory we construct a new efficient cluster algorithm for the Ising model. The construction is very different from the standard Swendsen-Wang algorithm and related to worm algorithms. With the new algorithm we have measured the…

We study a model in which p independent Ising spins are coupled to 2d quantum gravity (in the form of dynamical planar phi-cubed graphs). Consideration is given to the p tends to infinity limit in which the partition function becomes…