Worm Monte Carlo study of the honeycomb-lattice loop model
From MaRDI portal
Publication:632406
DOI10.1016/j.nuclphysb.2011.01.003zbMath1208.82010arXiv1011.1980MaRDI QIDQ632406
Youjin Deng, Timothy M. Garoni, Qing-Quan Liu
Publication date: 24 March 2011
Published in: Nuclear Physics. B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.1980
65C05: Monte Carlo methods
82B20: Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics
82D40: Statistical mechanics of magnetic materials
Related Items
Geometric exponents of dilute loop models, The \(O(n)\) loop model on a three-dimensional lattice, Simulating the all-order strong coupling expansion. V: Ising gauge theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Critical loop gases and the worm algorithm
- Conformal field theory
- Random-cluster representation of the Blume-Capel model
- A worm algorithm for the fully-packed loop model
- A guide to stochastic Löwner evolution and its applications
- Critical behavior of two-dimensional spin models and charge asymmetry in the Coulomb gas
- Critical phenomena and renormalization-group theory
- Simulating the all-order strong coupling expansion. III: \(O(N)\) sigma/loop models
- SLE for theoretical physicists
- Chromatic polynomials of large triangular lattices
- Critical exponents of domain walls in the two-dimensional Potts model
- Geometric properties of two-dimensional O(n) loop configurations
- Operator spectrum and exact exponents of the fully packed loop model
- Exact Results for Hamiltonian Walks from the Solution of the Fully Packed Loop Model on the Honeycomb Lattice
- Finite average lengths in critical loop models
- A new Kempe invariant and the (non)-ergodicity of the Wang–Swendsen–Kotecký algorithm
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- A Guide to Monte Carlo Simulations in Statistical Physics
