Recurrent graphs where two independent random walks collide finitely often
From MaRDI portal
Abstract: We present a class of graphs where simple random walk is recurrent, yet two independent walkers meet only finitely many times almost surely. In particular, the comb lattice, obtained from Z^2 by removing all horizontal edges off the X-axis, has this property. We also conjecture that the same property holds for some other graphs, including the incipient infinite cluster for critical percolation in Z^2.
Recommendations
Cited in
(28)- The shadow principle: an optimal survival strategy for a prey chased by random predators
- Recurrent random walks and the absence of continuous symmetry breaking on graphs
- Collisions of random walks
- Nonconcentration of return times
- Collisions of several walkers in recurrent random environments
- From fractals in external DLA to internal DLA on fractals
- Directed polymers on infinite graphs
- Collisions of random walks in dynamic random environments
- Exceptional graphs for the random walk
- Arbitrary many Walkers meet infinitely often in a subballistic random environment
- Decomposing correlated random walks on common and counter movements
- Relations between cumulants in noncommutative probability
- 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
- scientific article; zbMATH DE number 1416163 (Why is no real title available?)
- Random systems in ultrametric spaces
- Recurrence and collisions of random walks
- Some results and problems for anisotropic random walks on the plane
- An elementary proof for the recurrence of the product graph ${\mathbb{Z}^2} \times \left\{ {0, 1, \cdots, l - 1} \right\}$
- Two random walks on the open cluster of \(\mathbb Z^{2}\) meet infinitely often
- Contact and voter processes on the infinite percolation cluster as models of host-symbiont interactions
- We like to walk on the comb
- About the distance between random walkers on some graphs
- Triple collisions on a comb graph
- Voter model in a random environment in \(\mathbb{Z}^d\)
- Infinitely many collisions between a recurrent simple random walk and arbitrary many transient random walks in a subballistic random environment
- Collisions of random walks in reversible random graphs
- A note on the finite collision property of random walks
This page was built for publication: Recurrent graphs where two independent random walks collide finitely often
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1768221)
