Collisions of random walks in reversible random graphs

DOI10.1214/ECP.V20-4330zbMATH Open1329.60357arXiv1505.02484MaRDI QIDQ894489FDOQ894489

Tom Hutchcroft, Yuval Peres

Publication date: 1 December 2015

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

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$.

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)

Cited In (12)

• Harnack inequality and one-endedness of UST on reversible random graphs
• Title not available (Why is that?)
• On the coalescence time of reversible random walks
• Gaussian bounds and collisions of variable speed random walks on lattices with power law conductances
• Non-intersection of transient branching random walks
• Coalescing random walk on unimodular graphs
• Uniqueness of the infinite tree in low-dimensional random forests
• Collisions of several walkers in recurrent random environments
• Collisions of random walks in dynamic random environments
• Arbitrary many Walkers meet infinitely often in a subballistic random environment
• Parking on transitive unimodular graphs
• Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Recurrent graphs where two independent random walks collide finitely often 👍 👎
• Collisions of random walks 👍 👎
• Collisions Among Random Walks on a Graph 👍 👎
• Coalescent random walks on graphs 👍 👎
• Collisions of several walkers in recurrent random environments 👍 👎
• Collisions of random walks in dynamic random environments 👍 👎
• Recurrence and Collisions of Random Walks 👍 👎
• Reversible random walks on dynamic 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)