About the distance between random walkers on some graphs

DOI10.1007/S10998-017-0184-1zbMATH Open1399.60081arXiv1604.08052OpenAlexW2408148746MaRDI QIDQ682135FDOQ682135

Authors: Endre Csáki, Pál Révész, Antónia Földes 

Publication date: 13 February 2018

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Abstract: We consider two or more simple symmetric walks on some graphs, e.g. the real line, the plane or the two dimensional comb lattice, and investigate the properties of the distance among the walkers.

Full work available at URL: https://arxiv.org/abs/1604.08052

Recommendations

• Recurrent graphs where two independent random walks collide finitely often
• Two random walks on the open cluster of \(\mathbb Z^{2}\) meet infinitely often
• Collisions of several walkers in recurrent random environments
• Meeting times of random walks on graphs
• Collisions of random walks in reversible random graphs

zbMATH Keywords

random walktransient random walkdistance between walkersupper and lower class test

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Sums of independent random variables; random walks (60G50) Brownian motion (60J65) Strong limit theorems (60F15)

Cites Work

• Title not available (Why is that?)
• Recurrent graphs where two independent random walks collide finitely often
• Collisions of random walks
• Random walk in random and non-random environments
• Asymptotic behaviour of the simple random walk on the 2-dimensional comb
• How big are the increments of the local time of a recurrent random walk?
• Strong limit theorems for a simple random walk on the 2-dimensional comb
• No more than three favorite sites for simple random walk
• Uniform asymptotic estimates of transition probabilities on combs
• Equidistribution of random walks on spheres

Cited In (5)

• RANDOM WALKS ON REGULAR POLYHEDRA AND OTHER DISTANCE–REGULAR GRAPHS
• Two random walks on the open cluster of \(\mathbb Z^{2}\) meet infinitely often
• Recurrent graphs where two independent random walks collide finitely often
• On the mean square displacement of a random walk on a graph
• Expected distance based on random walks

This page was built for publication: About the distance between random walkers on some graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q682135)