Answers are grounded in this paper and cite their sources.
We apply the event-chain algorithm proposed by Bernard et al. in 2009 to toy models of lattice QCD. We give a formal proof 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 nonlinear σ-model on the square lattice, and the SU(3)×SU(3) principal chiral model on the square lattice. In all these cases we find that critical slowing down is essentially eliminated.
No takes yet. Share an insight, caveat, or question.
Hasenbusch et al. (2018) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: