Performance of a worm algorithm in ϕ4 theory at finite quartic coupling

2011/01/18 by Tomasz Korzec, Ingmar Vierhaus, Ulli Wolff · 2 citations
Computer Science · Mathematics · Physics and Astronomy · #Advanced Data Storage Technologies #Algorithm #Algorithms and Data Compression #Artificial intelligence #Computer science #Lambda #Machine learning #Mathematics #Physics #Physics of Superconductivity and Magnetism #Quantum mechanics #hep-lat

paper · pdf · doi:10.1016/j.cpc.2011.03.018

10 pages, 2 Figs

arxiv created 2011/01/18 · openalex publication_date 2011/04/15 · arxiv updated 2015/05/27 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05

Abstract

Worm algorithms have been very successful with the simulation of sigma models with fixed length spins which result from scalar field theories in the limit of infinite quartic coupling lambda. Here we investigate closer their algorithmic efficiency at finite and even vanishing lambda for the one component model in dimensions D = 2, 3, 4.

Cited by

• Diagrammatic Monte Carlo for the weak-coupling expansion of non-Abelian lattice field theories: Large-N U(N)×U(N) principal chiral model
• Approximate dual representation for Yang–Mills SU(2) gauge theory