Critical Line of the O() Loop Model on the Square Lattice
arXiv:1306.4996 · doi:10.1103/PhysRevE.88.021301
Abstract
An efficient algorithm is presented to simulate the O(N) loop model on the square lattice for arbitrary values of . The scheme combines the worm algorithm with a new data structure to resolve both the problem of loop crossings and the necessity of counting the number of loops at each Monte Carlo update. With the use of this scheme, the line of critical points (and other properties) of the O() model on the square lattice for have been determined.
arXiv comment9 pages, 5 figures
References in corpus (7)
- Worm algorithms for classical statistical models
- Dense loops, supersymmetry, and Goldstone phases in two dimensions
- Cluster simulations of loop models on two-dimensional lattices
- Intersecting Loop Models on Z^D: Rigorous Results
- Geometric Properties of the Three-Dimensional Ising and XY Models
- Critical Loop Gases and the Worm Algorithm
- Crossover phenomena involving the dense O() phase