Two random walks on the open cluster of \(\mathbb Z^{2}\) meet infinitely often
From MaRDI portal
Publication:625828
DOI10.1007/s11425-010-4064-xzbMath1216.05147OpenAlexW2002803001MaRDI QIDQ625828
Publication date: 25 February 2011
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-010-4064-x
Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Random walks on graphs (05C81)
Related Items
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 ⋮ Voter model in a random environment in \(\mathbb{Z}^d\) ⋮ Arbitrary many Walkers meet infinitely often in a subballistic random environment ⋮ Collisions of random walks in dynamic random environments
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the finite collision property of random walks
- Recurrent graphs where two independent random walks collide finitely often
- Random walks on supercritical percolation clusters
- Collisions of random walks
- A Characterization of the Invariant Measures for an Infinite Particle System with Interactions. II
This page was built for publication: Two random walks on the open cluster of \(\mathbb Z^{2}\) meet infinitely often