Random walk on the randomly-oriented Manhattan lattice

From MaRDI portal
Publication:1663754

DOI10.1214/18-ECP144zbMATH Open1397.82046arXiv1802.01558MaRDI QIDQ1663754FDOQ1663754

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

Publication date: 23 August 2018

Published in: Electronic Communications in Probability (Search for Journal in Brave)

Abstract: In the randomly-oriented Manhattan lattice, every line in mathbbZd is assigned a uniform random direction. We consider the directed graph whose vertex set is mathbbZd 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.


Full work available at URL: https://arxiv.org/abs/1802.01558





Cites Work


Cited In (8)






This page was built for publication: Random walk on the randomly-oriented Manhattan lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1663754)