Answers are grounded in this paper and cite their sources.
Computer computations have been carried out for various orders of self-avoiding random walks used to simulate flexible macromolecules. (The order of a walk is defined as the number of steps in the longest loop excluded by reason of the self-avoiding feature.) Calculations have been carried out for walks of orders up through 10 on a simple square lattice in two dimensions and for walks of orders up through 12 on a tetrahedral lattice in three dimensions. The calculations established precisely the parameters associated with the asymptotic behavior of long chains subject to the model assumed. The results are in agreement with earlier theoretical predictions as to form, and they serve to identify the factors contributing to increasing chain dimensions with length of walk. Asymptotically, the mean square end-to-end separation is linear in the number of steps for any self-avoiding walk of finite order. The behavior of completely self-avoiding walks (i.e., those of unlimited order) is represented very closely by the envelope of asymptotes corresponding to walks of different orders. In addition, the largest symmetric and antisymmetric eigenvalues associated with the transition matrix governing unit increments in contour chain length have been evaluated. Those eigenvalues determine an upper limit to the asymptotic behavior of long model chains.
No takes yet. Share an insight, caveat, or question.
Wall et al. (1976) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: