Related papers: Invaded cluster algorithm for equilibrium critical…
The invaded cluster approach is extended to 2D Potts model with annealed vacancies by using the random-cluster representation. Geometrical arguments are used to propose the algorithm which converges to the tricritical point in the…
The invaded cluster algorithm, a new method for simulating phase transitions, is described in detail. Theoretical, albeit nonrigorous, justification of the method is presented and the algorithm is applied to Potts models in two and three…
We demonstrate that the invaded cluster algorithm, recently introduced by Machta et al, is a fast and reliable tool for determining the critical temperature and the magnetic critical exponent of periodic and aperiodic ferromagnetic Ising…
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 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…
In finite-size scaling analyses of Monte Carlo simulations of second-order phase transitions one often needs an extended temperature range around the critical point. By combining the parallel tempering algorithm with cluster updates and an…
We present a detailed study of the Equilibriumlike invaded cluster algorithm (EIC), recently proposed as an extension of the invaded cluster (IC) algorithm, designed to drive the system to criticality while still preserving the equilibrium…
We propose an extension of the nonequilibrium invaded cluster (IC) algorithm, which reestablishes a correct scaling of fluctuations at criticality and also self-adjusts to the critical temperature. We show that by introducing a single…
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…
The invaded cluster algorithm is used to study the XY model in two and three dimensions up to sizes 2000^2 and 120^3 respectively. A soft spin O(2) model, in the same universality class as the 3D XY model, is also studied. The static…
We present a detailed description of the idea and procedure for the newly proposed Monte Carlo algorithm of tuning the critical point automatically, which is called the probability-changing cluster (PCC) algorithm [Y. Tomita and Y. Okabe,…
In finite-size scaling analyses of Monte Carlo simulations of second-order phase transitions one often needs an extended temperature/energy range around the critical point. By combining the replica-exchange algorithm with cluster updates…
Finding the ground state of Ising spin glasses is notoriously difficult due to disorder and frustration. Often, this challenge is framed as a combinatorial optimization problem, for which a common strategy employs simulated annealing, a…
Information percolation is a new method for analyzing stochastic spin systems through classifying and controlling the clusters of information-flow in the space-time slab. It yielded sharp mixing estimates (cutoff with an $O(1)$-window) for…
A comparison between single-cluster and single-spin algorithms is made for the Ising model in 2 and 3 dimensions. We compare the amount of computer time needed to achieve a given level of statistical accuracy, rather than the speed in terms…
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…
In this paper, we present a cluster algorithm for the numerical simulations of non-additive hard-core mixtures. This algorithm allows one to simulate and equilibrate systems with a number of particles two orders of magnitude larger than…
The properties of the pure-site clusters of spin models, i.e. the clusters which are obtained by joining nearest-neighbour spins of the same sign, are here investigated. In the Ising model in two dimensions it is known that such clusters…
In recent years, a better understanding of the Monte Carlo method has provided us with many new techniques in different areas of statistical physics. Of particular interest are so called cluster methods, which exploit the considerable…
In this paper, we present a cluster algorithm for the simulation of hard spheres and related systems. In this algorithm, a copy of the configuration is rotated with respect to a randomly chosen pivot point. The two systems are then…