Collisions of random walks in reversible random graphs

DOI10.1214/ECP.V20-4330MaRDI QIDQ894489zbMATH OpenFDO

Authors Tom Hutchcroft, Yuval Peres

Publication date 1 December 2015

Published in Electronic Communications in Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1505.02484

zbMATH Keywords

random walkscollisionsunimodular random graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Sums of independent random variables; random walks (60G50) Random walks on graphs (05C81) Processes in random environments (60K37)

Abstract: 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 $mathbb{Z}^2$.

Recommendations

• Collisions Among Random Walks on a Graph
• Recurrent graphs where two independent random walks collide finitely often
• Reversible random walks on dynamic graphs
• Collisions of random walks
• Recurrence and collisions of random walks
• Collisions of random walks in dynamic random environments
• scientific article; zbMATH DE number 1416163
• Collisions of several walkers in recurrent random environments
• Coalescent random walks on graphs

Cited in

(22)

• scientific article; zbMATH DE number 1416163 (Why is no real title available?)
• Harnack inequality and one-endedness of UST on reversible random graphs
• Exceptional graphs for the random walk
• On the coalescence time of reversible random walks
• Gaussian bounds and collisions of variable speed random walks on lattices with power law conductances
• Some sufficient conditions for infinite collisions of simple random walks on a wedge comb
• Infinite collision property for the three-dimensional uniform spanning tree
• Two random walks on the open cluster of \(\mathbb Z^{2}\) meet infinitely often
• Non-intersection of transient branching random walks
• Nonconcentration of return times
• Coalescing random walk on unimodular graphs
• A note on the finite collision property of random walks
• Uniqueness of the infinite tree in low-dimensional random forests
• Scaling limit of the collision measures of multiple random walks
• Recurrent graphs where two independent random walks collide finitely often
• Recurrence and collisions of random walks
• Collisions of random walks
• Collisions of several walkers in recurrent random environments
• Collisions of random walks in dynamic random environments
• About the distance between random walkers on some graphs
• Arbitrary many Walkers meet infinitely often in a subballistic random environment
• Parking on transitive unimodular graphs

This page was built for publication: Collisions of random walks in reversible random graphs

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