加载中…
Let be the uniform spanning tree on , whose probability law is denoted by . For -a.s. realization of , the recurrence of the the simple random walk on is proved in [5] and it is also demonstrated in [8] that two independent simple random walks on collide infinitely often. In this article, we will give a quantitative estimate on the number of collisions of two independent simple random walks on , which provides another proof of the infinite collision property of .

生成讲解博客的中文版本

生成AI智能校验的中文版本