About the distance between random walkers on some graphs

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.

Saved in:
Bibliographic Details
Published in:arXiv.org 2016-07
Main Authors: Csaki, Endre, Foldes, Antonia, Revesz, Pal
Format: Article
Language:English
Subjects:
Graphs
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2331-8422