Recurrence and transience of random difference equations in the critical case
Abstract
For i.i.d. random vectors (M1,Q1),(M2,Q2),… such that M>0 a.s., Q≥ 0 a.s. and P(Q=0)<1, the random difference equation Xn=MnXn-1+Qn, n=1,2,…, is studied in the critical case when the random walk with increments M1, M2 is oscillating. We provide conditions for the null-recurrence and transience of the Markov chain (Xn)n 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.