Collisions of Random Walks in Reversible Random Graphs
ELECTRONIC COMMUNICATIONS IN PROBABILITY(2015)
摘要
We prove that in any recurrent reversible random rooted graph, two independent simple random walks started at the same vertex collide infinitely often almost surely. This applies to the Uniform Infinite Planar Triangulation and Quadrangulation and to the Incipient Infinite Cluster in Z(2).
更多查看译文
关键词
Random Walks,collisions,unimodular random graphs
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络