Abstract
A ‘connective constant' is defined for self-avoiding random walk derived by erasing loops from simple random walk. For d ≧ 5, it is shown that this distribution on n-step self-avoiding paths approaches a uniform distribution in a weak sense.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Reference4 articles.
1. On the Number of Self‐Avoiding Walks. II
2. A self-avoiding random walk
3. Poor man's Monte Carlo;Hammersley;J. R. Statist. Soc.,1954
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献