About the distance between random walkers on some graphs

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

Research output: Contribution to journalArticle


We consider two or more simple symmetric walks on Zd and the 2-dimensional comb lattice, and in case of finite collision, we investigate the properties of the distance among the walkers.

Original languageEnglish
Pages (from-to)36-57
Number of pages22
JournalPeriodica Mathematica Hungarica
Issue number1
Publication statusPublished - Sep 1 2017


  • Collision
  • Distance
  • Random walk
  • Strong theorems

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint Dive into the research topics of 'About the distance between random walkers on some graphs'. Together they form a unique fingerprint.

  • Cite this