Cluster Simulation of the O(N) loop model on the Honeycomb lattice
  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 representation of a $N$-color Ashkin-Teller model on the triangular lattice. The latter model with integer $N$ can be simulated by means of an embedding Swendsen-Wang-type cluster method. By taking into account the symmetry among loops of different colors, we develop another version of the Swendsen-Wang-type method. This version allows the number of colors $N$ to take any real value $N \geq 1$. As an application, we investigate the $N=1.25, 1.50, 1.75$, and 2 loop model at criticality. The determined values of various critical exponents are in excellent agreement with theoretical predictions. In particular, from quantities associated with half of the loops, we determine some critical exponents that corresponds to those for the tricritical $q=N^2$ Potts model but have not been observed yet. Dynamic scaling behavior of the algorithm is also analyzed. The numerical data strongly suggest that our cluster algorithm {\it hardly} suffers from critical slowing down. 
Youjin Deng, Wenan Guo, and Henk W.J. Blote