Large favourite sites of simple random walk and the wiener process

Endre Csáki, Zhan Shi

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Let U(n) denote the most visited point by a simple symmetric random walk {Sk}k≥0 in the first n steps. It is known that U(n) and max0≤k≤n Sk satisfy the same law of the iterated logarithm, but have different upper functions (in the sense of P. Lévy). The distance between them however turns out to be transient. In this paper, we establish the exact rate of escape of this distance. The corresponding problem for the Wiener process is also studied.

Original languageEnglish
JournalElectronic Journal of Probability
Volume3
Publication statusPublished - Sep 30 1998

    Fingerprint

Keywords

  • Favourite site
  • Local time
  • Random walk
  • Wiener process

ASJC Scopus subject areas

  • Statistics and Probability
  • Statistics, Probability and Uncertainty

Cite this