Abstract
This paper develops nonasymptotic growth and concentration bounds for a product of independent random matrices. These results sharpen and generalize recent work of Henriksen–Ward, and they are similar in spirit to the results of Ahlswede–Winter and of Tropp for a sum of independent random matrices. The argument relies on the uniform smoothness properties of the Schatten trace classes.
Original language | English (US) |
---|---|
Pages (from-to) | 1767-1799 |
Number of pages | 33 |
Journal | Foundations of Computational Mathematics |
Volume | 22 |
Issue number | 6 |
DOIs | |
State | Published - Dec 2022 |
Keywords
- Large deviation
- Random matrices
ASJC Scopus subject areas
- Analysis
- Computational Mathematics
- Computational Theory and Mathematics
- Applied Mathematics