Enumeration of self-avoiding walks on the square lattice

Details Enumeration of self-avoiding walks on the square lattice Enumeration of self-avoiding walks on the square lattice

2004-04-30

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

J. Phys. A 37, 5503-5524 (2004)

Physics

Condensed Matter

Statistical Mechanics

24 pages, 6 figures

Scientific paper

10.1088/0305-4470/37/21/002

We describe a new algorithm for the enumeration of self-avoiding walks on the square lattice. Using up to 128 processors on a HP Alpha server cluster we have enumerated the number of self-avoiding walks on the square lattice to length 71. Series for the metric properties of mean-square end-to-end distance, mean-square radius of gyration and mean-square distance of monomers from the end points have been derived to length 59. Analysis of the resulting series yields accurate estimates of the critical exponents $\gamma$ and $\nu$ confirming predictions of their exact values. Likewise we obtain accurate amplitude estimates yielding precise values for certain universal amplitude combinations. Finally we report on an analysis giving compelling evidence that the leading non-analytic correction-to-scaling exponent $\Delta_1=3/2$.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-286752