Infinite collision property for the three-dimensional uniform spanning tree

DOI10.1142/S2661335223500053MaRDI QIDQ6423934zbMATH OpenOpenAlexFDO

Authors Satomi Watanabe

Publication date 20 January 2023

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1142/s2661335223500053

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Processes in random environments (60K37) Critical phenomena in equilibrium statistical mechanics (82B27) Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44)

Abstract: Let $mathcalU$ be the uniform spanning tree on $mathbb{Z}^3$, whose probability law is denoted by $mathbfP$. For $mathbfP$-a.s. realization of $mathcalU$, the recurrence of the the simple random walk on $mathcalU$ is proved in [5] and it is also demonstrated in [8] that two independent simple random walks on $mathcalU$ collide infinitely often. In this article, we will give a quantitative estimate on the number of collisions of two independent simple random walks on $mathcalU$, which provides another proof of the infinite collision property of $mathcalU$.

Recommendations

• Collisions of random walks
• Collisions of random walks in reversible random graphs
• Scaling limits of the three-dimensional uniform spanning tree and associated random walk
• The number of spanning clusters of the uniform spanning tree in three dimensions
• A note on the finite collision property of random walks

Cited in

(1)

• Infinitely many collisions between a recurrent simple random walk and arbitrary many transient random walks in a subballistic random environment

This page was built for publication: Infinite collision property for the three-dimensional uniform spanning tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6423934)