Abstract
We develop cluster algorithms for a broad class of loop models on two-dimensional lattices, including several standard O(n) loop models at n≥1. We show that our algorithm has little or no critical slowing-down when 1≤n≤2. We use this algorithm to investigate the honeycomb-lattice O(n) loop model, for which we determine several new critical exponents, and a square-lattice O(n) loop model, for which we obtain new information on the phase diagram.
Original language | English (US) |
---|---|
Article number | 120601 |
Journal | Physical Review Letters |
Volume | 98 |
Issue number | 12 |
DOIs | |
State | Published - Mar 21 2007 |
ASJC Scopus subject areas
- General Physics and Astronomy