A simple proof of heavy tail estimates for affine type Lipschitz recursions

From MaRDI portal
(Redirected from Publication:730355)




Abstract: We study the affine recursion Xn=AnXn1+Bn where (An,Bn)inmathbbR+imesmathbbR is an i.i.d. sequence and recursions Xn=Phin(Xn1) defined by Lipschitz transformations such that Phi(x)geqAx+B. It is known that under appropriate hypotheses the stationary solution X has regularly varying tail, i.e. lim_{t oinfty} t^{alpha} {mathbb P}[X>t] = C. However positivity of C in general is either unknown or requires some additional involved arguments. In this paper we give a simple proof that C>0. This applies, in particular, to the case when Kesten-Goldie assumptions are satisfied.









This page was built for publication: A simple proof of heavy tail estimates for affine type Lipschitz recursions

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