Related papers: Cluster Algorithms For Anisotropic Quantum Spin Mo…

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…

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…

We propose a highly efficient "worm" like cluster Monte Carlo algorithm for the quantum rotor model in the link-current representation. We explicitly prove detailed balance for the new algorithm even in the presence of disorder. For the…

We present a new type of cluster algorithm that strongly reduces critical slowing down in simulations of vertex models. Since the clusters are closed paths of bonds, we call it the {\em loop algorithm}. The basic steps in constructing a…

We developed a technique to determine suitable spin models for small embedded clusters of arbitrary geometry by combining the spin-cluster expansion with the relativistic disordered local moment scheme. We present results for uncovered and…

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…

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…

Quantum spin systems with strong geometric restrictions give rise to rich quantum phases such as valence bond solids and spin liquid states. However, the geometric restrictions often hamper the application of sophisticated numerical…

We present an algorithmic framework for a variant of the quantum Monte Carlo operator-loop algorithm, where non-local cluster updates are constructed in a way that makes each individual loop smaller. The algorithm is designed to increase…

We review the background of the cluster algorithms in Monte Carlo simulation of statistical physics problems. One of the first such successful algorithm was developed by Swendsen and Wang eight years ago. In contrast to the local…

We propose a generalization of the Quantum Monte Carlo loop algorithm to the t-J model by a mapping to three coupled six-vertex models. The autocorrelation times are reduced by orders of magnitude compared to the conventional local…

Generalized rules for building and flipping clusters in the quantum Monte Carlo loop algorithm are presented for the XXZ-model in a uniform magnetic field along the Z-axis. As is demonstrated for the Heisenberg antiferromagnet it is…

A generalization to the quantum case of a recently introduced algorithm (Y. Tomita and Y. Okabe, Phys. Rev. Lett. {\bf 86}, 572 (2001)) for the determination of the critical temperature of classical spin models is proposed. We describe a…

We extend the newly proposed probability-changing cluster (PCC) Monte Carlo algorithm to the study of systems with the vector order parameter. Wolff's idea of the embedded cluster formalism is used for assigning clusters. The…

Within a general cluster framework, we discuss the loop-algorithm, a new type of cluster algorithm that reduces critical slowing down in vertex models and in quantum spin systems. We cover the example of the 6-vertex model in detail. For…

We present an efficient and exact Monte Carlo algorithm to simulate reversible aggregation of particles with dedicated binding sites. This method introduces a novel data structure of dynamic bond tree to record clusters and sequences of…

We present the loop algorithm, a new type of cluster algorithm that we recently introduced for the F model. Using the framework of Kandel and Domany, we show how to GENERALIZE the algorithm to the arrow flip symmetric 6 vertex model. We…

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 study the possible rotation of cluster galaxies, developing, testing and applying a novel algorithm which identifies rotation, if such does exist, as well as its rotational centre, its axis orientation, rotational velocity amplitude and,…

We present an algorithm for Monte Carlo simulations of a nearest-neighbor spin ice model based on its cluster representation. To assess its performance, we estimate a relaxation time, and find that, in contrast to the Metropolis algorithm,…