Self-avoiding random loops
- 1 January 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 34 (6) , 1509-1516
- https://doi.org/10.1109/18.21290
Abstract
A random loop, or polygon, is a simple random walk whose trajectory is a simple Jordan curve. The study of random loops is extended in two ways. First, the probability Pn(x,y) that a random n-step loop contains a point (x,y) in the interior of the loop is studied, and (1/2, 1/2) is shown to be (1/2)-(1/ n). It is plausible that Pn(x,y) tends toward 1/2 for all ( x,y), but this is not proved even for (x,y)=(3/2,1/2) A way is offered to simulate random n-step self-avoiding loops. Numerical evidence obtained with this simulation procedure suggests that the probability Pn (3/2,1/2)≈(1/2)-(c/n), for some fixed cKeywords
This publication has 19 references indexed in Scilit:
- Monte Carlo test of the Flory-Huggins theory for polymer mixturesPhysical Review B, 1987
- Trapping of genuine self-avoiding walksPhysical Review A, 1986
- On the correction-to-scaling exponent of linear polymers in two dimensionsJournal of Physics A: General Physics, 1986
- Polymer conformations through 'wiggling'Journal of Physics A: General Physics, 1985
- New Monte Carlo method for the self-avoiding walkJournal of Statistical Physics, 1985
- Study of Monte Carlo methods for generating self-avoiding walksJournal of Statistical Physics, 1983
- A new Monte-Carlo approach to the critical properties of self-avoiding random walksJournal de Physique, 1983
- Pair distribution function and pair potential of lattice model chains under theta conditions, 1. Numerical evaluationDie Makromolekulare Chemie, 1976
- ‘Monte Carlo’ computer simulation of chain molecules. IMolecular Physics, 1969
- The number of polygons on a latticeMathematical Proceedings of the Cambridge Philosophical Society, 1961