Testing the event-chain algorithm in asymptotically free models

7Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

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.

References Powered by Scopus

Nonuniversal critical dynamics in Monte Carlo simulations

2363Citations
N/AReaders
Get full text

Collective Monte Carlo Updating for Spin Systems

2201Citations
N/AReaders
Get full text

The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walk

830Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Flow-based generative models for Markov chain Monte Carlo in lattice field theory FLOW-BASED GENERATIVE MODELS for MARKOV CHAIN ... M. S. ALBERGO, G. KANWAR, and P. E. SHANAHAN

171Citations
N/AReaders
Get full text

Equivariant flow-based sampling for lattice gauge theory

155Citations
N/AReaders
Get full text

Flow-based sampling for fermionic lattice field theories

39Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Hasenbusch, M., & Schaefer, S. (2018). Testing the event-chain algorithm in asymptotically free models. Physical Review D, 98(5). https://doi.org/10.1103/PhysRevD.98.054502

Readers' Seniority

Tooltip

Researcher 3

75%

PhD / Post grad / Masters / Doc 1

25%

Readers' Discipline

Tooltip

Physics and Astronomy 4

100%

Save time finding and organizing research with Mendeley

Sign up for free