Conditioned local limit theorems for products of positive random matrices
Abstract
Let (gn)n≥ 1 be a sequence of independent and identically distributed positive random d× d matrices, where d≥ 2 is an integer. For any starting point x ∈ R+d with |x| = 1 and y ∈ R, we define the exit time τx, y = ∈f \ k ≥ 1: y + |gk ·s g1 x| < 0 \. In this paper, we investigate the conditioned local probability P (y + |gn ·s g1 x| ∈ z + [0, ], τx, y > n) under various assumptions on y, z and . For the case where z = O(n), we establish an exact asymptotic result as n ∞, uniformly in y and , which extends the classical Caravenna conditioned local limit theorem to the case of products of positive random matrices. Our proof does not rely on the reversibility techniques. Furthermore, for arbitrary z ∈ R+, we deduce a uniform upper bound with rate n-3/2.
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.