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.
No takes yet. Share an insight, caveat, or question.
Gregory F. Lawler (1983) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: