Rate of escape and central limit theorem for the supercritical Lamperti problem

Mikhail V. Menshikov, A.R. Wade

Research output: Contribution to journalArticle

5 Citations (Scopus)
32 Downloads (Pure)

Abstract

The study of discrete-time stochastic processes on the half-line with mean drift at x given by μ1(x)→0 as x→∞ is known as Lamperti's problem. We give sharp almost-sure bounds for processes of this type in the case where μ1(x) is of order x−β for some β(0,1). The bounds are of order t1/(1+β), so the process is super-diffusive but sub-ballistic (has zero speed). We make minimal assumptions on the moments of the increments of the process (finiteness of (2+2β+ε)-moments for our main results, so fourth moments certainly suffice) and do not assume that the process is time-homogeneous or Markovian. In the case where xβμ1(x) has a finite positive limit, our results imply a strong law of large numbers, which strengthens and generalizes earlier results of Lamperti and Voit. We prove an accompanying central limit theorem, which appears to be new even in the case of a nearest-neighbour random walk, although our result is considerably more general. This answers a question of Lamperti. We also prove transience of the process under weaker conditions than those that we have previously seen in the literature. Most of our results also cover the case where β=0. We illustrate our results with applications to birth-and-death chains and to multi-dimensional non-homogeneous random walks.
Original languageEnglish
Pages (from-to)2078-2099
Number of pages22
JournalStochastic Processes and their Applications
Volume120
Issue number10
DOIs
Publication statusPublished - Sep 2010

Keywords

  • lamperti’s problem
  • almost-sure bounds
  • law of large numbers
  • central limit theorem
  • birth-and-death chain
  • transience
  • inhomogeneous random walk

Fingerprint Dive into the research topics of 'Rate of escape and central limit theorem for the supercritical Lamperti problem'. Together they form a unique fingerprint.

  • Cite this