2000 character limit reached
Performance of a worm algorithm in $φ^4$ theory at finite quartic coupling
Published 18 Jan 2011 in hep-lat | (1101.3452v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
