## Saibal Mitra ; Bernard Nienhuis - Osculating Random Walks on Cylinders

dmtcs:3320 - Discrete Mathematics & Theoretical Computer Science, January 1, 2003, DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03) - https://doi.org/10.46298/dmtcs.3320
Osculating Random Walks on Cylinders

Authors: Saibal Mitra ; Bernard Nienhuis

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 considered completed. We also consider families of such paths which together cover every edge of the lattice once and visit every vertex twice. Because these paths may touch but not intersect each other and themselves, we call them osculating walks. The ensemble of such families is also known as the dense $O(n=1)$ model. We consider in particular such paths in a cylindrical geometry, with the cylindrical axis parallel with one of the lattice directions. We formulate a conjecture for the probability that a face of the lattice is surrounded by m distinct osculating paths. For even system sizes we give a conjecture for the probability that a path winds round the cylinder. For odd system sizes we conjecture the probability that a point is visited by a path spanning the infinite length of the cylinder. Finally we conjecture an expression for the asymptotics of a binomial determinant

Volume: DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03)
Section: Proceedings
Published on: January 1, 2003
Imported on: May 10, 2017
Keywords: Random walks,O(n) loop model,[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG]