About the distance between random walkers on some graphs (Q682135): Difference between revisions

A classical result of Pólya says that simple random walks on \(\mathbb{Z}^1\) and \(\mathbb{Z}^2\) are recurrent and two independent walkers meet infinitely many times (almost surely), while on \(\mathbb{Z}^3\) a simple random walk is transient and independent walkers meet only finitely many times. In the present paper, the authors study related problems, concerning two or more simple symmetric walks on \(\mathbb{Z}^d\) or on the 2-dimensional comb lattice, and in the case of finitely many meetings they study properties of the distance between the ``walkers''. Their results contain upper and lower class tests, and rely on an approximation of the random walks by the Wiener process.