Related papers: Multicanonical Cluster Algorithm
I present a hybrid-like two-step algorithm, which combines a microcanonical update of a spin system using demons, with a multicanonical demon refresh. The algorithm is free from the supercritical slowing down that burdens the canonical…
I propose a numerical simulation algorithm for statistical systems which combines a microcanonical transfer of energy with global changes in clusters of spins. The advantages of the cluster approach near a critical point augment the speed…
A generalization of the microcanonical ensemble suggests a simple strategy for the simulation of first order phase transitions. At variance with flat-histogram methods, there is no iterative parameters optimization, nor long waits for…
Relying on the recently proposed multicanonical algorithm, we present a numerical simulation of the first order phase transition in the 2d 10-state Potts model on lattices up to sizes $100\times100$. It is demonstrated that the new…
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 present a fast and robust cluster update algorithm that is especially efficient in implementing the task of image segmentation using the method of superparamagnetic clustering. We apply it to a Potts model with spin interactions that are…
We present an algorithm for cluster dynamics to efficiently simulate large systems on MIMD parallel computers with large numbers of processors. The method divides physical space into rectangular cells which are assigned to processors and…
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 have made a study of several update algorithms using the XY model. We find that sequential local overrelaxation is not ergodic at the scale of typical Monte Carlo simulation time. We have introduced a new multisite microcanonical update…
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…
A cluster algorithm is presented for the simulation of the q-state Potts models in which the number of spins is conserved in each state. The algorithm constructs Fortuin-Kasteleyn cluster configurations from spin configurations, in a way…
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…
A new Monte Carlo algorithm for 2-dimensional spin glasses is presented. The use of clusters makes possible global updates and leads to a gain in speed of several orders of magnitude. As an example, we study the 2-dimensional +/-J…
We implement a cluster-update Monte Carlo algorithm to simulate magnetic dipoles of the XY-spin type confined in a two-dimensional plane. The long-range character and anisotropy in the dipole interaction are handled by using the…
Cluster algorithms are developed for simulating quantum spin systems like the one- and two-dimensional Heisenberg ferro- and anti-ferromagnets. The corresponding two- and three-dimensional classical spin models with four-spin couplings are…
Cluster algorithms are developed for simulating quantum spin systems like the one- and two-dimensional Heisenberg ferro- and anti-ferromagnets. The corresponding two- and three-dimensional classical spin models with four-spin couplings are…
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 have proposed a cluster heat bath method in Monte Carlo simulations of Ising models in which one of the possible spin configurations of a cluster is selected in accordance with its Boltzmann weight. We have argued that the method…
Monte Carlo simulations have boosted the numerical study of several different physical systems and in particular, the canonical ensemble has been especially useful because of the existence of easy and efficient relaxation algorithms…
Cluster algorithms for classical and quantum spin systems are discussed. In particular, the cluster algorithm is applied to classical O(N) lattice actions containing interactions of more than two spins. The performance of the multi-cluster…