Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Conditioned limit theorems for products of random matrices (1411.0423v7)

Published 3 Nov 2014 in math.PR

Abstract: Consider the product $G_{n}=g_{n} ... g_{1}$ of the random matrices $g_{1},...,g_{n}$ in $GL(d,\mathbb{R}) $ and the random process $ G_{n}v=g_{n}... g_{1}v$ in $\mathbb{R}{d}$ starting at point $v\in \mathbb{R}{d}\smallsetminus {0} .$ It is well known that under appropriate assumptions, the sequence $(\log \Vert G_{n}v\Vert){n\geq 1}$ behaves like a sum of i.i.d.\ r.v.'s and satisfies standard classical properties such as the law of large numbers, law of iterated logarithm and the central limit theorem. Denote by $\mathbb{B}$ the closed unit ball in $\mathbb{R}{d}$ and by $\mathbb{B}{c}$ its complement. For any $v\in \mathbb{B}{c}$ define the exit time of the random process $G{n}v$ from $\mathbb{B}{c}$ by $\tau_{v}=\min {n\geq 1:G_{n}v\in \mathbb{B}} .$ We establish the asymptotic as $n \to \infty $ of the probability of the event ${\tau_{v}>n} $ and find the limit law for the quantity $\frac{1}{\sqrt{n}} \log \Vert G_{n}v\Vert $ conditioned that $\tau_{v}>n.$

Summary

We haven't generated a summary for this paper yet.