Endpoint distribution of self-avoiding walks

Research output: Contribution to journalArticle

Abstract

The dimerization algorithm for the generation of self-avoiding walks was modified to generate a large number of walks with a relatively large endpoint separation. Walks of up to 512 steps were generated on the square and cubic lattices using this modified algorithm. From these walks the distribution of endpoint x coordinates of self-avoiding walks was accurately determined over a much wider range than would be possible using earlier techniques. The distributions obtained were found to be in general agreement with those proposed earlier for shorter walks by Domb, Gillis, and Wilmers.

Original languageEnglish (US)
Pages (from-to)5309-5314
Number of pages6
JournalThe Journal of chemical physics
StatePublished - 1973

Fingerprint

Dimerization
cubic lattices
dimerization

ASJC Scopus subject areas

  • Atomic and Molecular Physics, and Optics

Cite this

Endpoint distribution of self-avoiding walks. / Grishman, Ralph.

In: The Journal of chemical physics, 1973, p. 5309-5314.

Research output: Contribution to journalArticle

@article{91c60867a54e4b61a8ff55e14672452b,
title = "Endpoint distribution of self-avoiding walks",
abstract = "The dimerization algorithm for the generation of self-avoiding walks was modified to generate a large number of walks with a relatively large endpoint separation. Walks of up to 512 steps were generated on the square and cubic lattices using this modified algorithm. From these walks the distribution of endpoint x coordinates of self-avoiding walks was accurately determined over a much wider range than would be possible using earlier techniques. The distributions obtained were found to be in general agreement with those proposed earlier for shorter walks by Domb, Gillis, and Wilmers.",
author = "Ralph Grishman",
year = "1973",
language = "English (US)",
pages = "5309--5314",
journal = "Journal of Chemical Physics",
issn = "0021-9606",
publisher = "American Institute of Physics Publising LLC",

}

TY - JOUR

T1 - Endpoint distribution of self-avoiding walks

AU - Grishman, Ralph

PY - 1973

Y1 - 1973

N2 - The dimerization algorithm for the generation of self-avoiding walks was modified to generate a large number of walks with a relatively large endpoint separation. Walks of up to 512 steps were generated on the square and cubic lattices using this modified algorithm. From these walks the distribution of endpoint x coordinates of self-avoiding walks was accurately determined over a much wider range than would be possible using earlier techniques. The distributions obtained were found to be in general agreement with those proposed earlier for shorter walks by Domb, Gillis, and Wilmers.

AB - The dimerization algorithm for the generation of self-avoiding walks was modified to generate a large number of walks with a relatively large endpoint separation. Walks of up to 512 steps were generated on the square and cubic lattices using this modified algorithm. From these walks the distribution of endpoint x coordinates of self-avoiding walks was accurately determined over a much wider range than would be possible using earlier techniques. The distributions obtained were found to be in general agreement with those proposed earlier for shorter walks by Domb, Gillis, and Wilmers.

UR - http://www.scopus.com/inward/record.url?scp=36849114186&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=36849114186&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:36849114186

SP - 5309

EP - 5314

JO - Journal of Chemical Physics

JF - Journal of Chemical Physics

SN - 0021-9606

ER -