Asymptotics of stationary solutions of multivariate stochastic recursions with heavy tailed inputs and related limit theorems

preprint2011arXivOpen access

Abstract

Let ΦnΦ_n be an i.i.d. sequence of Lipschitz mappings of Rd\R^d. We study the Markov chain {Xnx}n=0∞\{X_n^x\}_{n=0}^\infty on Rd\R^d defined by the recursion Xnx=Φn(Xn−1x)X_n^x = Φ_n(X^x_{n-1}), n∈Nn\in\N, X0x=x∈RdX_0^x=x\in\R^d. We assume that Φn(x)=Φ(Anx,Bn(x))Φ_n(x)=Φ(A_n x,B_n(x)) for a fixed continuous function Φ:Rd×Rd→RdΦ:\R^d\times \R^d\to\R^d, commuting with dilations and i.i.d random pairs (An,Bn)(A_n,B_n), where An∈End(Rd)A_n\in {End}(\R^d) and BnB_n is a continuous mapping of Rd\R^d. Moreover, BnB_n is αα-regularly varying and AnA_n has a faster decay at infinity than BnB_n. We prove that the stationary measure νν of the Markov chain {Xnx}\{X_n^x\} is αα-regularly varying. Using this result we show that, if α<2α<2, the partial sums Snx=∑k=1nXkxS_n^x=\sum_{k=1}^n X_k^x, appropriately normalized, converge to an αα-stable random variable. In particular, we obtain new results concerning the random coefficient autoregressive process Xn=AnXn−1+BnX_n = A_n X_{n-1}+B_n.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.