Cluster simulations of loop models on two-dimensional lattices
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.