Two random walks on the open cluster of Z^2 meet infinitely often
From MaRDI portal
Publication:625828
Recommendations
- Recurrent graphs where two independent random walks collide finitely often
- About the distance between random walkers on some graphs
- Collisions of random walks in dynamic random environments
- Collisions of random walks in reversible random graphs
- Random walk on the infinite cluster of the percolation model
Cites work
- scientific article; zbMATH DE number 5819433 (Why is no real title available?)
- scientific article; zbMATH DE number 3839873 (Why is no real title available?)
- scientific article; zbMATH DE number 3892344 (Why is no real title available?)
- A Characterization of the Invariant Measures for an Infinite Particle System with Interactions. II
- A note on the finite collision property of random walks
- Collisions of random walks
- Random walks on supercritical percolation clusters
- Recurrent graphs where two independent random walks collide finitely often
Cited in
(7)- Voter model in a random environment in \(\mathbb{Z}^d\)
- Gaussian bounds and collisions of variable speed random walks on lattices with power law conductances
- Collisions of random walks
- Effective resistances for supercritical percolation clusters in boxes
- 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
This page was built for publication: Two random walks on the open cluster of \(\mathbb Z^{2}\) meet infinitely often
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q625828)
