Efficient implementation of the pivot algorithm for self-avoiding walks

Details Efficient implementation of the pivot algorithm for self-avoiding walks Efficient implementation of the pivot algorithm for self-avoiding walks

2010-05-10

arxiv.org/abs/1005.1444v1

Physics

Condensed Matter

Statistical Mechanics

35 pages, 24 figures, 4 tables. Accepted for publication in the Journal of Statistical Physics.

Scientific paper

The pivot algorithm for self-avoiding walks has been implemented in a manner which is dramatically faster than previous implementations, enabling extremely long walks to be efficiently simulated. We explicitly describe the data structures and algorithms used, and provide a heuristic argument that the mean time per attempted pivot for $N$-step self-avoiding walks is $O(1)$ for the square and simple cubic lattices. Numerical experiments conducted for self-avoiding walks with up to 268 million steps are consistent with $o(\log N)$ behavior for the square lattice and $O(\log N)$ behavior for the simple cubic lattice. Our method can be adapted to other models of polymers with short-range interactions, on the lattice or in the continuum, and hence promises to be widely useful.

Affiliated with

Also associated with

No associations

Rating

Efficient implementation of the pivot algorithm for self-avoiding walks 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 Efficient implementation of the pivot algorithm for self-avoiding walks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient implementation of the pivot algorithm for self-avoiding walks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-626752