A deterministic walk on the randomly oriented Manhattan lattice

Andrea Collevecchio, Kais Hamza, Laurent Tournier

Research output: Contribution to journalArticleResearchpeer-review


Consider a randomly-oriented two dimensional Manhattan lattice where each horizontal line and each vertical line is assigned, once and for all, a random direction by flipping independent and identically distributed coins. A deterministic walk is then started at the origin and at each step moves diagonally to the nearest vertex in the direction of the horizontal and vertical lines of the present location. This definition can be generalized, in a natural way, to larger dimensions, but we mainly focus on the two dimensional case. In this context the process localizes on two vertices at all large times, almost surely. We also provide estimates for the tail of the length of paths, when the walk is defined on the two dimensional lattice. In particular, the probability of the path to be larger than n decays sub-exponentially in n. It is easy to show that higher dimensional paths may not localize on two vertices but will still eventually become periodic, and are therefore bounded.

Original languageEnglish
Article number137
Number of pages20
JournalElectronic Journal of Probability
Publication statusPublished - 1 Jan 2019


  • 82C41
  • AMS MSC 2010: 60K37
  • Dependent percolation
  • Deterministic walk in random environment

Cite this