Abstract
Suppose that X1, ...,Xn, ... are i.i.d. rotationally invariant N-by-N matrices. Let ∏n = Xn X1. It is known that n-1 log | ∏n | converges to a non-random limit. We prove that under certain additional assumptions on matrices Xi the speed of convergence to this limit does not decrease when the size of matrices, N, grows.
| Original language | English |
|---|---|
| Pages (from-to) | 890-906 |
| Number of pages | 17 |
| Journal | Annals of Applied Probability |
| Volume | 20 |
| Issue number | 3 |
| DOIs | |
| State | Published - Jun 2010 |
Keywords
- Furstenberg-Kesten theorem
- Random matrices
Fingerprint
Dive into the research topics of 'Products of random matrices: Dimension and growth in norm'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver