English

Tail behavior of stationary solutions of random difference equations: the case of regular matrices

Probability 2013-04-08 v3

Abstract

Given a sequence (Mn,Qn)n1(M_{n},Q_{n})_{n\ge 1} of i.i.d. random variables with generic copy (M,Q)(M,Q) such that MM is a regular d×dd\times d matrix and QQ takes values in Rd\mathbb{R}^{d}, we consider the random difference equation (RDE) Rn=MnRn1+QnR_{n}=M_{n}R_{n-1}+Q_{n}, n1n\ge 1. Under suitable assumptions, this equation has a unique stationary solution RR such that, for some κ>0\kappa>0 and some finite positive and continuous function KK on Sd1:={xRd:x=1}S^{d-1}:=\{x \in \mathbb{R}^{d}:|x|=1\}, limttκP(xR>t)=K(x) \lim_{t \to \infty} t^{\kappa} P(xR>t)=K(x) for all xSd1x \in S^{d-1} holds true. This result is originally due to Kesten and Le Page. The purpose of this article is to show how regeneration methods can be used to provide a much shorter argument (in particular for the positivity of K). It is based on a multidimensional extension of Goldie's implicit renewal theory.

Keywords

Cite

@article{arxiv.1009.1728,
  title  = {Tail behavior of stationary solutions of random difference equations: the case of regular matrices},
  author = {Gerold Alsmeyer and Sebastian Mentemeier},
  journal= {arXiv preprint arXiv:1009.1728},
  year   = {2013}
}