About the distance between random walkers on some graphs
classification
🧮 math.PR
keywords
distancegraphssomewalkerscombconsiderdimensionalinvestigate
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.