Random walk on the randomly-oriented Manhattan lattice

Sean Ledger, Bálint Tóth, Benedek Valkó

Research output: Contribution to journalArticle (Academic Journal)peer-review

Abstract

In the randomly-oriented Manhattan lattice, every line in Zd is assigned a uniform random direction. We consider the directed graph whose vertex set is Zd and whose edges connect nearest neighbours, but only in the direction fixed by the line orientations. Random walk on this directed graph chooses uniformly from the d legal neighbours at each step. We prove that this walk is superdiffusive in two and three dimensions. The model is diffusive in four and more dimensions.
Original languageEnglish
Article number43
Number of pages11
JournalElectronic Communications in Probability
Volume23
DOIs
Publication statusPublished - 25 Jul 2018

Keywords

  • Random walks in random environment
  • superdiffusivity

Fingerprint Dive into the research topics of 'Random walk on the randomly-oriented Manhattan lattice'. Together they form a unique fingerprint.

Cite this