Iterated random functions and slowly varying tails

From MaRDI portal
Publication:901296

DOI10.1016/J.SPA.2015.09.005zbMATH Open1329.60253arXiv1408.1658OpenAlexW2963850737MaRDI QIDQ901296FDOQ901296

Piotr Dyszewski

Publication date: 23 December 2015

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Abstract: Consider a sequence of i.i.d. random Lipschitz functions Psinngeq0. Using this sequence we can define a Markov chain via the recursive formula Rn+1=Psin+1(Rn). It is a well known fact that under some mild moment assumptions this Markov chain has a unique stationary distribution. We are interested in the tail behaviour of this distribution in the case when Psi0(t)approxA0t+B0. We will show that under subexponential assumptions on the random variable log+(A0veeB0) the tail asymptotic in question can be described using the integrated tail function of log+(A0veeB0). In particular we will obtain new results for the random difference equation Rn+1=An+1Rn+Bn+1..


Full work available at URL: https://arxiv.org/abs/1408.1658




Recommendations




Cites Work


Cited In (14)





This page was built for publication: Iterated random functions and slowly varying tails

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q901296)