Random walk on the randomly-oriented Manhattan lattice
Preprint
Abstract
In the randomly-oriented Manhattan lattice, every line in $\mathbb{Z}^d$ is assigned a uniform random direction. We consider the directed graph whose vertex set is $\mathbb{Z}^d$ 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.
Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Quenched central limit theorem for random walks in doubly stochastic random environmentThe Annals of Probability, 2018
- Central limit theorem for random walks in doubly stochastic random environment: ${\mathscr{H}_{-1}}$ sufficesThe Annals of Probability, 2017
- Superdiffusive Bounds on Self-repellent Brownian Polymers and Diffusion in the Curl of the Gaussian Free Field in d=2Journal of Statistical Physics, 2012
- A functional limit theorem for a 2d-random walk with dependent marginalsElectronic Communications in Probability, 2008
- Superdiffusivity of Asymmetric Exclusion Process in Dimensions One and TwoCommunications in Mathematical Physics, 2004
- On the Superdiffusive Behavior of Passive Tracer with a Gaussian DriftJournal of Statistical Physics, 2002
- Is transport in porous media always diffusive? A counterexampleWater Resources Research, 1980