Testing the event-chain algorithm in asymptotically free models

Abstract

We apply the event-chain algorithm proposed by Bernard, Krauth and Wilson in 2009 to toy models of lattice QCD. We give a formal prove of stability of the algorithm. We study its performance at the example of the massive Gaussian model on the square and the simple cubic lattice, the $O(3)$-invariant non-linear $\sigma$-model and the $SU(3)\times SU(3)$ principle chiral model on the square lattice. In all these cases we find that critical slowing down is essentially eliminated.

18 pages, 7 figures

References in corpus (2)

• The Binder Cumulant at the Kosterlitz-Thouless Transition
• Irreversible Markov chains in spin models: Topological excitations

Cited by in corpus (8)

• Flow-based generative models for Markov chain Monte Carlo in lattice field theory
• Equivariant flow-based sampling for lattice gauge theory
• Flow-based sampling for fermionic lattice field theories
• Exotic Tetraquark states with two $\bar{b}$-quarks and $J^P=0^{+}$ and $1^{+}$ $B_s$ states in a nonperturbatively-tuned Lattice NRQCD setup
• JeLLyFysh-Version1.0 -- a Python application for all-atom event-chain Monte Carlo
• Event-chain Monte Carlo with factor fields
• Multithreaded event-chain Monte Carlo with local times
• Hard-disk dipoles and non-reversible Markov chains