Valleys and the maximum local time for random walk in random environment

Amir Dembo, Nina Gantert, Yuval Peres, Zhan Shi

Research output: Contribution to journalArticlepeer-review

14 Scopus citations

Abstract

Let ξ (n, x) be the local time at x for a recurrent one-dimensional random walk in random environment after n steps, and consider the maximum ξ*(n) = max x ξ(n, x). It is known that lim sup $$_n\xi^*(n)/n$$ is a positive constant a.s. We prove that lim inf $$_n(log\!!!log\!!!log\!!!n) \xi^*(n)/n$$ is a positive constant a.s. this answers a question of P. Révész [5]. The proof is based on an analysis of the valleys in the environment, defined as the potential wells of record depth. In particular, we show that almost surely, at any time n large enough, the random walker has spent almost all of its lifetime in the two deepest valleys of the environment it has encountered. We also prove a uniform exponential tail bound for the ratio of the expected total occupation time of a valley and the expected local time at its bottom.

Original languageEnglish
Pages (from-to)443-473
Number of pages31
JournalProbability Theory and Related Fields
Volume137
Issue number3-4
DOIs
StatePublished - Mar 2007
Externally publishedYes

Keywords

  • Local time
  • Random walk in random environment

Fingerprint

Dive into the research topics of 'Valleys and the maximum local time for random walk in random environment'. Together they form a unique fingerprint.

Cite this