Convergence to Stable Laws and a Local Limit Theorem for Products of Positive Random Matrices
Jianzhang Mei () and
Quansheng Liu ()
Additional contact information
Jianzhang Mei: Tsinghua University
Quansheng Liu: CNRS UMR 6205, LMBA
Journal of Theoretical Probability, 2025, vol. 38, issue 4, 1-31
Abstract:
Abstract We consider the products $$G_n = A_n \cdots A_1$$ G n = A n ⋯ A 1 of independent and identically distributed nonnegative $$d \times d$$ d × d matrices $$(A_i)_{i \geqslant 1}$$ ( A i ) i ⩾ 1 . For any starting point $$x \in {\mathbb {R}}_+^d$$ x ∈ R + d with unit norm, we establish the convergence to a stable law for the norm cocycle $$\log | G_nx |$$ log | G n x | , jointly with its direction $$G_n \cdot x = G_n x / | G_n x |$$ G n · x = G n x / | G n x | . We also prove a local limit theorem for the couple $$ (\log |G_nx|, G_n \cdot x)$$ ( log | G n x | , G n · x ) and find the exact rate of its convergence.
Keywords: Products of random matrices; Stable laws; Weak convergence; Rate of convergence; Local limit theorem; Primary 60B10; 60G50; 60E07; Secondary 60B20 (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s10959-025-01434-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jotpro:v:38:y:2025:i:4:d:10.1007_s10959-025-01434-9
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10959
DOI: 10.1007/s10959-025-01434-9
Access Statistics for this article
Journal of Theoretical Probability is currently edited by Andrea Monica
More articles in Journal of Theoretical Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().