About the distance between random walkers on some graphs
Probability
2016-07-27 v2
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.
Cite
@article{arxiv.1604.08052,
title = {About the distance between random walkers on some graphs},
author = {Endre Csaki and Antonia Foldes and Pal Revesz},
journal= {arXiv preprint arXiv:1604.08052},
year = {2016}
}
Comments
27 pages