Recurrent graphs where two independent random walks collide finitely often
From MaRDI portal
Publication:1768221
DOI10.1214/ECP.v9-1111zbMath1060.60044arXivmath/0406487MaRDI QIDQ1768221
Yuval Peres, Manjunath Krishnapur
Publication date: 14 March 2005
Published in: Electronic Communications in Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0406487
Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05)
Related Items
Gaussian bounds and collisions of variable speed random walks on lattices with power law conductances ⋮ The shadow principle: an optimal survival strategy for a prey chased by random predators ⋮ Collisions of random walks ⋮ Two random walks on the open cluster of \(\mathbb Z^{2}\) meet infinitely often ⋮ Nonconcentration of return times ⋮ Contact and voter processes on the infinite percolation cluster as models of host-symbiont interactions ⋮ We like to walk on the comb ⋮ A note on the finite collision property of random walks ⋮ Collisions of several walkers in recurrent random environments ⋮ About the distance between random walkers on some graphs ⋮ Voter model in a random environment in \(\mathbb{Z}^d\) ⋮ From fractals in external DLA to internal DLA on fractals ⋮ 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 ⋮ Directed polymers on infinite graphs ⋮ Random systems in ultrametric spaces ⋮ Collisions of random walks in dynamic random environments ⋮ Some Results and Problems for Anisotropic Random Walks on the Plane
