Products of random matrices: Dimension and growth in norm
Vladislav Kargin

TL;DR
This paper investigates the convergence rate of the normalized logarithm of the norm of products of i.i.d. rotationally invariant matrices as the matrix size increases, establishing conditions under which the convergence speed remains unaffected by dimension.
Contribution
It proves that under specific assumptions, the convergence speed of the norm growth rate does not diminish as the matrix dimension increases.
Findings
Convergence speed remains stable with increasing matrix size.
Established conditions for dimension-independent convergence rate.
Enhanced understanding of growth behavior in high-dimensional random matrix products.
Abstract
Suppose that are i.i.d. rotationally invariant -by- matrices. Let . It is known that converges to a nonrandom limit. We prove that under certain additional assumptions on matrices the speed of convergence to this limit does not decrease when the size of matrices, , grows.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
