• Media type: E-Article
  • Title: Renewal approximation for the absorption time of a decreasing Markov chain
  • Contributor: Alsmeyer, Gerold; Marynych, Alexander
  • Published: Cambridge University Press (CUP), 2016
  • Published in: Journal of Applied Probability, 53 (2016) 3, Seite 765-782
  • Language: English
  • DOI: 10.1017/jpr.2016.39
  • ISSN: 1475-6072; 0021-9002
  • Keywords: Statistics, Probability and Uncertainty ; General Mathematics ; Statistics and Probability
  • Origination:
  • Footnote:
  • Description: <jats:title>Abstract</jats:title><jats:p>We consider a Markov chain (<jats:italic>M</jats:italic><jats:sub><jats:italic>n</jats:italic></jats:sub>)<jats:sub><jats:italic>n</jats:italic>≥0</jats:sub> on the set ℕ<jats:sub>0</jats:sub> of nonnegative integers which is eventually decreasing, i.e. ℙ{<jats:italic>M</jats:italic><jats:sub><jats:italic>n</jats:italic>+1</jats:sub>&lt;<jats:italic>M</jats:italic><jats:sub><jats:italic>n</jats:italic></jats:sub>  |  <jats:italic>M</jats:italic><jats:sub><jats:italic>n</jats:italic></jats:sub>≥<jats:italic>a</jats:italic>}=1 for some <jats:italic>a</jats:italic>∈ℕ and all <jats:italic>n</jats:italic>≥0. We are interested in the asymptotic behavior of the law of the stopping time <jats:italic>T</jats:italic>=<jats:italic>T</jats:italic>(<jats:italic>a</jats:italic>)≔inf{<jats:italic>k</jats:italic>∈ℕ<jats:sub>0</jats:sub>:  <jats:italic>M</jats:italic><jats:sub><jats:italic>k</jats:italic></jats:sub>&lt;<jats:italic>a</jats:italic>} under ℙ<jats:sub><jats:italic>n</jats:italic></jats:sub>≔ℙ (·  |  <jats:italic>M</jats:italic><jats:sub>0</jats:sub>=<jats:italic>n</jats:italic>) as <jats:italic>n</jats:italic>→∞. Assuming that the decrements of (<jats:italic>M</jats:italic><jats:sub><jats:italic>n</jats:italic></jats:sub>)<jats:sub><jats:italic>n</jats:italic>≥0</jats:sub> given <jats:italic>M</jats:italic><jats:sub>0</jats:sub>=<jats:italic>n</jats:italic> possess a kind of stationarity for large <jats:italic>n</jats:italic>, we derive sufficient conditions for the convergence in the minimal <jats:italic>L</jats:italic><jats:sup><jats:italic>p</jats:italic></jats:sup>-distance of ℙ<jats:sub><jats:italic>n</jats:italic></jats:sub>(<jats:italic>T</jats:italic>−<jats:italic>a</jats:italic><jats:sub>n</jats:sub>)∕<jats:italic>b</jats:italic><jats:italic>n</jats:italic>∈·) to some nondegenerate, proper law and give an explicit form of the constants <jats:italic>a</jats:italic><jats:sub>n</jats:sub> and <jats:italic>b</jats:italic><jats:sub><jats:italic>n</jats:italic></jats:sub>.</jats:p>