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
| Original language | English |
|---|---|
| Pages (from-to) | 120601-1 - 120601-4 |
| Number of pages | 4 |
| Journal | Physical Review Letters |
| Volume | 98 |
| Issue number | 12 |
| DOIs | |
| Publication status | Published - 2007 |
| Externally published | Yes |
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver