相关论文: Cluster Simulation of the O(N) loop model on the H…

We develop cluster algorithms for a broad class of loop models on two-dimensional lattices, including several standard O(n) loop models at n \ge 1. We show that our algorithm has little or no critical slowing-down when 1 \le n \le 2. We use…

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…

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…

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 percolation problem based on critical loop configurations of the O($n$) loop model on the honeycomb lattice. We define dual clusters as groups of sites on the dual triangular lattice that are not separated by a loop, and…

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…

The O(n) loop model on the honeycomb lattice with mixed ordinary and special boundary conditions is solved exactly by means of the Bethe ansatz. The calculation of the dominant finite-size corrections to the eigenspectrum yields the mixed…

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 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 O(N) cluster Monte Carlo method for Ising models with long-range interactions is presented. Our novel algorithm does not introduce any cutoff for interaction range and thus it strictly fulfills the detailed balance. 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…

The critical behavior of two-dimensional ${\rm O}(N)$ $\sigma$ models with $N\leq 2$ on the square, triangular, and honeycomb lattices is investigated by an analysis of the strong-coupling expansion of the two-point fundamental Green's…

We solve the O(n) model, defined in terms of self- and mutually avoiding loops coexisting with voids, on a 3-simplex fractal lattice, using an exact real space renormalization group technique. As the density of voids is decreased, the model…

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 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…

Inspired by the lattice structure of the unhydrated variant of the superconducting material Na$_x$CoO$_2 \cdot$yH$_2$O at $ x = {1/3}$, we study the $t$-$J$ model on a honeycomb lattice by using an efficient loop-cluster algorithm. The…

The phase diagram of the O(n) model, in particular the special case $n=0$, is studied by means of transfer-matrix calculations on the loop representation of the O(n) model. The model is defined on the square lattice; the loops are allowed…

The classical spin $O(n)$ model is a model on a $d$-dimensional lattice in which a vector on the $(n-1)$-dimensional sphere is assigned to every lattice site and the vectors at adjacent sites interact ferromagnetically via their inner…

We reformulate the O(N) sigma model as a loop model whose configurations are the all-order strong coupling graphs of the original model. The loop configurations are represented by a pointer list in the computer and a Monte Carlo update…