About the distance between random walkers on some graphs

DOI10.1007/S10998-017-0184-1zbMATH Open1399.60081OpenAlexW2408148746MaRDI 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)

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

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)

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.

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

Cites Work

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

Cited In (6)

• 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
• Arbitrary many Walkers meet infinitely often in a subballistic random environment
• 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)