Tail behavior of stationary solutions of random difference equations: the case of regular matrices
Abstract
Given a sequence (Mn,Qn)n 1 of i.i.d. random variables with generic copy (M,Q) such that M is a regular d× d matrix and Q takes values in Rd, we consider the random difference equation (RDE) Rn=MnRn-1+Qn, n 1. Under suitable assumptions, this equation has a unique stationary solution R such that, for some >0 and some finite positive and continuous function K on Sd-1:=\x ∈ Rd:|x|=1\, t ∞ t P(xR>t)=K(x) for all x ∈ Sd-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.
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.