Graphical Representations and Worm Algorithms for the O() Spin Model
arXiv:2306.12218 · doi:10.1088/1572-9494/acfbdf
Abstract
We present a family of graphical representations for the O() spin model, where represents the spin dimension, and corresponds to the Ising, XY and Heisenberg models, respectively. With an integer parameter , each configuration is the coupling of copies of subgraphs consisting of directed flows and copies of subgraphs constructed by undirected loops, which we call the XY and Ising subgraphs, respectively. On each lattice site, the XY subgraphs satisfy the Kirchhoff flow-conservation law and the Ising subgraphs obey the Eulerian bond condition. Then, we formulate worm-type algorithms and simulate the O() model on the simple-cubic lattice for from 2 to 6 at all possible . It is observed that the worm algorithm has much higher efficiency than the Metropolis method, and, for a given , the efficiency is an increasing function of . Beside Monte Carlo simulations, we expect that these graphical representations would provide a convenient basis for the study of the O() spin model by other state-of-the-art methods like the tensor network renormalization.
arXiv comment10 pages, 6 figures
References in corpus (16)
- Tensor Network Renormalization
- Worm algorithms for classical statistical models
- Irreversible Monte Carlo Algorithms for Efficient Sampling
- Exact blocking formulas for spin and gauge models
- Surface and bulk transitions in three-dimensional O(n) models
- Universal Conductivity in a Two-Dimensional Superfluid-to-Insulator Quantum Critical System
- High-precision Monte Carlo study of several models in the three-dimensional U(1) universality class
- Simulating the All-Order Strong Coupling Expansion III: O(N) sigma/loop models
- Dual lattice representations for O(N) and CP(N-1) models with a chemical potential
- Dynamic critical behavior of the Chayes-Machta-Swendsen-Wang algorithm
- Numerical study of the enlarged O(5) symmetry of the 3-D antiferromagnetic RP2 spin model
- Irreversible Markov chain Monte Carlo algorithm for self-avoiding walk
- Lifted Worm Algorithm for the Ising Model
- Trapping Centers at the Superfluid-Mott-insulator Criticality: Transition between Charge-quantized States
- Comparison of algorithms for solving the sign problem in the O(3) model in 1+1 dimensions at finite chemical potential
- The halon: a quasiparticle featuring critical charge fractionalization