English

Recurrence and transience of random difference equations in the critical case

Probability 2021-05-12 v1

Abstract

For i.i.d. random vectors (M1,Q1),(M2,Q2),(M_{1},Q_{1}),(M_{2},Q_{2}),\ldots such that M>0M>0 a.s., Q0Q\geq 0 a.s. and P(Q=0)<1\mathbb{P}(Q=0)<1, the random difference equation Xn=MnXn1+QnX_{n}=M_{n}X_{n-1}+Q_{n}, n=1,2,n=1,2,\ldots, is studied in the critical case when the random walk with increments logM1,logM2\log M_{1},\log M_{2} is oscillating. We provide conditions for the null-recurrence and transience of the Markov chain (Xn)n0(X_{n})_{n\ge 0} by inter alia drawing on techniques developed in the related article Alsmeyer et al (2017) for another case exhibiting the null-recurrence/transience dichotomy.

Keywords

Cite

@article{arxiv.2105.04994,
  title  = {Recurrence and transience of random difference equations in the critical case},
  author = {Gerold Alsmeyer and Alexander Iksanov},
  journal= {arXiv preprint arXiv:2105.04994},
  year   = {2021}
}

Comments

18 pages, submitted for publication