Interacting random processes; statistical mechanics type models; percolation theory (60K35) Sums of independent random variables; random walks (60G50) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Zero-one laws (60F20) Continuous-time Markov processes on discrete state spaces (60J27)
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.
Recommendations
Cited in
(7)- Recurrence and density decay for diffusion-limited annihilating systems
- On the coalescence time of reversible random walks
- Large void zones and occupation times for coalescing random walks
- Coalescing random walk on unimodular graphs
- Mean field behavior during the big bang regime for coalescing random walks
- Parking on transitive unimodular graphs
- Percolation of coalescing random walks
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)
