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

Abstract

Let n be an i.i.d. sequence of Lipschitz mappings of d. We study the Markov chain \Xnx\n=0∞ on d defined by the recursion Xnx = n(Xxn-1), n∈, X0x=x∈d. We assume that n(x)=(An x,Bn(x)) for a fixed continuous function :d× dd, commuting with dilations and i.i.d random pairs (An,Bn), where An∈ End(d) and Bn is a continuous mapping of d. Moreover, Bn is α-regularly varying and An has a faster decay at infinity than Bn. We prove that the stationary measure of the Markov chain \Xnx\ is α-regularly varying. Using this result we show that, if α<2, the partial sums Snx=Σk=1n Xkx, appropriately normalized, converge to an α-stable random variable. In particular, we obtain new results concerning the random coefficient autoregressive process Xn = An Xn-1+Bn.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…