2023
DOI: 10.1214/22-aop1602
|View full text |Cite
|
Sign up to set email alerts
|

Berry–Esseen type bounds for the left random walk on GLd(R) under polynomial moment conditions

Abstract: with common distribution µ. In this paper, under standard assumptions on µ (strong irreducibility and proximality), we prove Berry-Esseen type theorems for log( A n ) when µ has a polynomial moment. More precisely, we get the rate ((log n)/n) q/2−1 when µ has a moment of order q ∈]2, 3] and the rate 1/ √ n when µ has a moment of order 4, which significantly improves earlier results in this setting.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(9 citation statements)
references
References 22 publications
0
9
0
Order By: Relevance
“…Taking m ∼ C log n, with C| log(1 − γ)| > 1/2, we infer that the right-hand side is bounded by D/ √ n, and we conclude thanks to Lemma 2.1 of [16], using Theorem 7.1.…”
Section: P(logmentioning
confidence: 55%
See 3 more Smart Citations
“…Taking m ∼ C log n, with C| log(1 − γ)| > 1/2, we infer that the right-hand side is bounded by D/ √ n, and we conclude thanks to Lemma 2.1 of [16], using Theorem 7.1.…”
Section: P(logmentioning
confidence: 55%
“…Proof. Applying Proposition 3.2 (with p = q) and Theorem 7.1, we see that we can use Lemma 2.1 of [16] with…”
Section: The Clt and The Asymptotic Variancementioning
confidence: 99%
See 2 more Smart Citations
“…Unlike Theorem 4.2, it is not simple to deduce the Berry–Esseen type bound for logMn$\log \Vert M_n\Vert$ from that of logMnv$\log \Vert M_n v\Vert$, the latter was proven by Bougerol [11]. Indeed, even in the independent and identically distributed case, although the Berry–Esseen bound for logMnv$\log \Vert M_n v\Vert$ has been known since the work of Le Page [50], the bounds for the matrix norm were only recently studied [28, 29, 67]. Below, we give a version of these results for the Markovian case adapting the approach of Xiao–Grama–Liu [67] and using our large deviation estimates (replacing the large deviation ingredient of [67] from [8] in the independent and identically distributed case).…”
Section: Markovian Random Matrix Productsmentioning
confidence: 99%