Heavy tail properties of stationary solutions of multidimensional stochastic recursions
Abstract
We consider the following recurrence relation with random i.i.d. coefficients (an,bn): xn+1=an+1 xn+bn+1 where an∈ GL(d,R),bn∈ Rd. Under natural conditions on (an,bn) this equation has a unique stationary solution, and its support is non-compact. We show that, in general, its law has a heavy tail behavior and we study the corresponding directions. This provides a natural construction of laws with heavy tails in great generality. Our main result extends to the general case the results previously obtained by H. Kesten in [16] under positivity or density assumptions, and the results recently developed in [17] in a special framework.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.