Performance of a worm algorithm in ?4 ? 4 theory at finite quartic coupling
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 ?. Here we investigate closer their algorithmic efficiency at finite and even vanishing ?  for the one component model in dimensions D=2,3,4 D = 2 , 3 , 4 .
monte carlo algorithm scalar quantum field theory critical slowing down