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

From MaRDI portal
Publication:863485

DOI10.1007/S00440-006-0005-6zbMATH Open1106.60082arXivmath/0508579OpenAlexW2594093088MaRDI QIDQ863485FDOQ863485


Authors: Amir Dembo, Nina Gantert, Yuval Peres, Zhan Shi Edit this on Wikidata


Publication date: 26 January 2007

Published in: Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)

Abstract: Let xi(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 xi(n)=maxxxi(n,x). It is known that limsupxi(n)/n is a positive constant a.s. We prove that liminfn(logloglogn)xi(n)/n is a positive constant a.s.; this answers a question of P. R'ev'esz (1990). The proof is based on an analysis of the {em 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.


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




Recommendations



Cites Work


Cited In (13)





This page was built for publication: Valleys and the maximum local time for random walk in random environment

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