Introduction to the non-asymptotic analysis of random matrices
University of Michigan–Ann Arbor
Indexed inarxivcrossrefdatacite
Abstract
This is a tutorial on some basic non-asymptotic methods and concepts in random matrix theory. The reader will learn several tools for the analysis of the extreme singular values of random matrices with independent rows or columns. Many of these methods sprung off from the development of geometric functional analysis since the 1970's. They have applications in several fields, most notably in theoretical computer science, statistics and signal processing. A few basic applications are covered in this text, particularly for the problem of estimating covariance matrices in statistics and for validating probabilistic constructions of measurement matrices in compressed sensing. These notes are written particularly…
Citation impact
582
total citations
- FWCI
- 142.74
- Percentile
- 100%
- References
- 75
Citations per year
Authors
1Topics & keywords
Topics
Keywords
- Random matrix
- Computer science
- Matrix analysis
- Probabilistic logic
- Matrix (chemical analysis)
- Covariance
- Signal processing
- Mathematical statistics
No related works found for this paper.