Renewal approximation for the absorption time of a decreasing Markov chain
Abstract
We consider a Markov chain (Mn)n 0 on the set N0 of nonnegative integers which is eventually decreasing, i.e. P\Mn+1<Mn|Mn a\=1 for some a∈N and all n 0. We are interested in the asymptotic behaviour of the law of the stopping time T=T(a):=∈f\k∈N0: Mk<a\ under Pn:=P(·|M0=n) as n∞. Assuming that the decrements of (Mn)n 0 given M0=n possess a kind of stationarity for large n, we derive sufficient conditions for the convergence in minimal Lp-distance of Pn((T-an)/bn∈·) to some non-degenerate, proper law and give an explicit form of the constants an and bn.
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.