Site recurrence for coalescing random walk

From MaRDI portal
Publication:303676

DOI10.1214/16-ECP5zbMATH Open1345.60110arXiv1510.04721MaRDI QIDQ303676FDOQ303676

Ori Gurel-Gurevich, Itai Benjamini, Harry Kesten, Matthew Junge, Eric Foxall

Publication date: 22 August 2016

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

Abstract: Begin continuous time random walks from every vertex of a graph and have particles coalesce when they collide. We use a duality relation with the voter model to prove the process is site recurrent on bounded degree graphs, and for Galton-Watson trees whose offspring distribution has exponential tail. We prove bounds on the occupation probability of a site, as well as a general 0-1 law. Similar conclusions hold for a coalescing process on trees where particles do not backtrack.


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




Recommendations





Cited In (7)





This page was built for publication: Site recurrence for coalescing random walk

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