Worm algorithms for classical statistical models

Details Worm algorithms for classical statistical models Worm algorithms for classical statistical models

2001-03-06

arxiv.org/abs/cond-mat/0103146v1

Physics

Condensed Matter

4 pages, latex, 2 figures

Scientific paper

10.1103/PhysRevLett.87.160601

We show that high-temperature expansions may serve as a basis for the novel approach to efficient Monte Carlo simulations. "Worm" algorithms utilize the idea of updating closed path configurations (produced by high-temperature expansions) through the motion of end points of a disconnected path. An amazing result is that local, Metropolis-type schemes may have dynamical critical exponents close to zero (i.e., their efficiency is comparable to the best cluster methods). We demonstrate this by calculating finite size scaling of the autocorrelation time for various (six) universality classes.

Affiliated with

Also associated with

No associations

Rating

Worm algorithms for classical statistical models does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Worm algorithms for classical statistical models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Worm algorithms for classical statistical models will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-431364