Related papers: Cluster simulations of loop models on two-dimensio…
We study the O(N) loop model on the Honeycomb lattice with real value $N \geq 1$ by means of a cluster algorithm. The formulation of the algorithm is based on the equivalence of the O(N) loop model and the low-temperature graphical…
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…
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 explore the phase diagram of an O(n) model on the honeycomb lattice with vacancies, using finite-size scaling and transfer-matrix methods. We make use of the loop representation of the O(n) model, so that $n$ is not restricted to…
Fully packed loop models on the square and the honeycomb lattice constitute new classes of critical behaviour, distinct from those of the low-temperature O(n) model. A simple symmetry argument suggests that such compact phases are only…
An efficient algorithm is presented to simulate the O(N) loop model on the square lattice for arbitrary values of $N>0$. The scheme combines the worm algorithm with a new data structure to resolve both the problem of loop crossings and the…
We study a class of loop models, parameterized by a continuously varying loop fugacity n, on the hydrogen-peroxide lattice, which is a three-dimensional cubic lattice of coordination number 3. For integer n > 0, these loop models provide…
We present a Markov-chain Monte Carlo algorithm of "worm"type that correctly simulates the O(n) loop model on any (finite and connected) bipartite cubic graph, for any real n>0, and any edge weight, including the fully-packed limit of…
A critical dilute O($n$) model on the kagome lattice is investigated analytically and numerically. We employ a number of exact equivalences which, in a few steps, link the critical O($n$) spin model on the kagome lattice to the exactly…
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…
In this article we report a preliminary investigation of the large $N$ limit of a generalized one-matrix model which represents an $O(n)$ symmetric model on a random lattice. The model on a regular lattice is known to be critical only for…
Two cluster algorithms, based on constructing and flipping loops, are presented for worldline quantum Monte Carlo simulations of fermions and are tested on the one-dimensional repulsive Hubbard model. We call these algorithms the loop-flip…
Dynamical behavior of the clusters during relaxation is studied in two-dimensional Potts model using cluster algorithm. Average cluster size and cluster formation velocity are calculated on two different lattice sizes for different number…
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 study the expansion of the surface thickness in the 2-dimensional lattice Sine Gordon model in powers of the fugacity z. Using the expansion to order z**2, we derive lines of constant physics in the rough phase. We describe and test a…
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…
The random-cluster model has been widely studied as a unifying framework for random graphs, spin systems and electrical networks, but its dynamics have so far largely resisted analysis. In this paper we analyze the Glauber dynamics of the…
The partition function of the O(n) loop model on the honeycomb lattice is mapped to that of the O(n) loop model on the 3-12 lattice. Both models share the same operator content and thus critical exponents. The critical points are related…
The O(n) non-linear $\sigma$-model is simulated on 2-dimensional regular and random lattices. We use two different levels of randomness in the construction of the random lattices and give a detailed explanation of the geometry of such…