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

preprint2011arXivOpen access

Abstract

Given a sequence (Mn,Qn)n≥1(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=MnRn−1+QnR_{n}=M_{n}R_{n-1}+Q_{n}, n≥1n\ge 1. Under suitable assumptions, this equation has a unique stationary solution RR such that, for some κ>0κ>0 and some finite positive and continuous function KK on Sd−1:={x∈Rd:∣x∣=1}S^{d-1}:=\{x \in \mathbb{R}^{d}:|x|=1\}, lim⁡t→∞tκP(xR>t)=K(x) \lim_{t \to \infty} t^κ P(xR>t)=K(x) for all x∈Sd−1x \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.

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.