Null-recurrence and transience of random difference equations in the contractive case
Gerold Alsmeyer, Dariusz Buraczewski, Alexander Iksanov

TL;DR
This paper investigates the long-term behavior of a recursive Markov chain defined by a random difference equation, providing criteria for null-recurrence and transience in the contractive case, and analyzing its attractor set.
Contribution
It offers new criteria for null-recurrence and transience of the chain under contractive conditions with occasional large jumps, and studies the attractor set under local contractivity.
Findings
Criteria for null-recurrence and transience are established.
Large values of Q can prevent positive recurrence despite contractivity.
The attractor set is characterized under local contractivity and recurrence.
Abstract
Given a sequence of independent, identically distributed ran\-dom vectors with nonnegative components, we consider the recursive Markov chain , defined by the random difference equation for , where is independent of . Criteria for the null-recurrence/transience are provided in the situation where is contractive in the sense that a.s., yet occasional large values of the overcompensate the contractive behavior so that positive recurrence fails to hold. We also investigate the attractor set of under the sole assumption that this chain is locally contractive and recurrent.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
