论文信息 - Series study of the one-dimensional 'true' self-avoiding walk

Series study of the one-dimensional 'true' self-avoiding walk

The 'true' self avoiding walk problem is formulated using a grand canonical approach, and exact enumeration methods are used to calculate the average end-to-end distance for one-dimensional 'true' self-avoiding walks with up to 21 steps. The results are in agreement with a universality picture obtained both from Monte Carlo simulations and from scaling and crossover arguments. The extrapolated value of the end-to-end distance exponent nu is nu =0.67+or-0.04.

[1] D. S. McKenzie. The end-to-end length distribution of self-avoiding walks , 1973 .

[2] M. Watts. The end-point distribution of self-avoiding walks on a crystal lattice. II. Loose-packed lattices , 1974 .

[3] Vladimir Privman,et al. Spiral self-avoiding walks , 1983 .

[4] D. S. McKenzie,et al. Shape of self-avoiding walk or polymer chain , 1971 .

[5] Shlomo Havlin,et al. Corrections to scaling in self-avoiding walks , 1983 .

[6] R. Stinchcombe,et al. Scaling and crossover in the one-dimensional true self-avoiding walk , 1984 .

[7] M. Watts,et al. The end-point distribution of self-avoiding walks on a crystal lattice , 1971 .

[8] L. Pietronero. Critical dimensionality and exponent of the "true" self-avoiding walk , 1983 .

[9] P. Grassberger,et al. The critical behaviour of two-dimensional self-avoiding random walks , 1982 .

[10] Daniel J. Amit,et al. Asymptotic behavior of the "true" self-avoiding walk , 1983 .

[11] B. Shapiro. A direct renormalisation group approach for the self-avoiding walk , 1978 .

[12] D. S. McKenzie. Polymers and scaling , 1976 .

[13] L. Pietronero,et al. "True" self-avoiding walk in one dimension , 1984 .