Related papers: Probability-Changing Cluster Algorithm for Potts M…
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…
Recently a cluster Monte Carlo algorithm has been used very successfully in the two-dimensional Edwards-Anderson (EA) model. We show that this algorithm and a variant thereof can also be used successfully in models with a non-zero spin…
A crossing probability for the critical four-state Potts model on an $L\times M$ rectangle on a square lattice is numerically studied. The crossing probability here denotes the probability that spin clusters cross from one side of the…
For $\Delta \ge 5$ and $q$ large as a function of $\Delta$, we give a detailed picture of the phase transition of the random cluster model on random $\Delta$-regular graphs. In particular, we determine the limiting distribution of the…
We consider q-state Potts models coupled by their energy operators. Restricting our study to self-dual couplings, numerical simulations demonstrate the existence of non-trivial fixed points for 2 <= q <= 4. These fixed points were first…
We discuss a new Monte Carlo algorithm for the simulation of complex fluids. This algorithm employs geometric operations to identify clusters of particles that can be moved in a rejection-free way. It is demonstrated that this geometric…
In 1986, Swendsen and Wang proposed a replica Monte Carlo algorithm for spin glasses [Phys. Rev. Lett. 57 (1986) 2607]. Two important ingredients are present, (1) the use of a collection of systems (replicas) at different of temperatures,…
By Monte Carlo simulation we study the critical exponents governing the transition of the three-dimensional classical O(4) Heisenberg model, which is considered to be in the same universality class as the finite-temperature QCD with…
We show that addition of Metropolis single spin-flips to the Wolff cluster flipping Monte Carlo procedure leads to a dramatic {\bf increase} in performance for the spin-1/2 Ising model. We also show that adding Wolff cluster flipping to the…
A cluster Monte Carlo algorithm for the Ashkin-Teller (AT) model is constructed according to the guidelines of a general scheme for such algorithms. Its dynamical behaviour is tested for the square lattice AT model. We perform simulations…
We use the single-cluster Monte Carlo update algorithm to simulate the Ising model on two-dimensional Poissonian random lattices with up to 80,000 sites which are linked together according to the Voronoi/Delaunay prescription. In one set of…
An algorithm for Monte Carlo simulations is proposed in which the parameter controlling the strength of the transition becomes a dynamical variable and in which efficient transitions are achieved by cluster steps. It allows to avoid the…
According to the recently obtained thermodynamic uncertainty relation, the microcanonical regions with a negative heat capacity can be accessed within a canonical-like description by using a thermostat with a fluctuating inverse…
We propose a novel recursive way of updating the tensors in projected entangled pair states by evolving the tensor in imaginary time evolution on clusters of different sizes. This generalizes the so- called simple update method of Jiang et…
Cluster molecular field approximations represent a substantial progress over the simple Weiss theory where only one spin is considered in the molecular field resulting from all the other spins. In this work we discuss a systematic way of…
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…
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…
For $d \ge 2$ and all $q\geq q_{0}(d)$ we give an efficient algorithm to approximately sample from the $q$-state ferromagnetic Potts and random cluster models on finite tori $(\mathbb Z / n \mathbb Z )^d$ for any inverse temperature…
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 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…