Sampling of General Correlators in Worm Algorithm-based Simulations
arXiv:1602.09017 · doi:10.1016/j.nuclphysb.2016.05.026
Abstract
Using the complex -model as a prototype for a system which is simulated by a worm algorithm, we show that not only the charged correlator , but also more general correlators such as or , as well as condensates like , can be measured at every step of the Monte Carlo evolution of the worm instead of on closed-worm configurations only. The method generalizes straightforwardly to other systems simulated by worms, such as spin or sigma models.
arXiv comment43 pages, 15 figures
References in corpus (11)
- Worm algorithms for classical statistical models
- Lattice study of the Silver Blaze phenomenon for a charged scalar phi-4 field
- Finite size effects in the presence of a chemical potential: A study in the classical non-linear O(2) sigma-model
- Method for simulating O(N) lattice models at finite density
- Simulating the All-Order Strong Coupling Expansion I: Ising Model Demo
- Simulating the All-Order Strong Coupling Expansion III: O(N) sigma/loop models
- Improving Wang-Landau sampling with adaptive windows
- Dual lattice representations for O(N) and CP(N-1) models with a chemical potential
- Worm algorithms for the 3-state Potts model with magnetic field and chemical potential
- Spectroscopy in finite density lattice field theory: An exploratory study in the relativistic Bose gas
- Performance of a worm algorithm in theory at finite quartic coupling
Cited by in corpus (6)
- Approaches to the sign problem in lattice field theory
- Generalization capabilities of translationally equivariant neural networks
- Worm Algorithm for CP(N-1) Model
- Dual formulations of Polyakov loop lattice models
- Oscillating propagators in heavy-dense QCD
- Approximate dual representation for Yang-Mills SU(2) gauge theory