Osculating Random Walks on Cylinders
We consider random paths on a square lattice which take a left or a right turn at every vertex. The possible turns are taken with equal probability, except at a vertex which has been visited before. In such case the vertex is left via the unused edge. When the initial edge is reached the path is con...
Auteurs principaux: | , |
---|---|
Format: | Article |
Langue: | English |
Publié: |
Discrete Mathematics & Theoretical Computer Science
2003-01-01
|
Collection: | Discrete Mathematics & Theoretical Computer Science |
Sujets: | |
Accès en ligne: | https://dmtcs.episciences.org/3320/pdf |