Recent developments in non-asymptotic theory of random matrices

2013/01/11 by Rudelson, Mark · 2 citations
#60B20 #FOS: Mathematics #Functional Analysis (math.FA) #Probability (math.PR)

paper · doi:10.48550/arxiv.1301.2382

Abstract

Non-asymptotic theory of random matrices strives to investigate the spectral properties of random matrices, which are valid with high probability for matrices of a large fixed size. Results obtained in this framework find their applications in high-dimensional convexity, analysis of convergence of algorithms, as well as in random matrix theory itself. In these notes we survey some recent results in this area and describe the techniques aimed for obtaining explicit probability bounds.

Cited by

• Robustness to Sparse Adversarial Corruption in Arbitrary Linear Measurements: Beyond Exact Recovery
• The smallest singular value of sparse discrete random matrices

Related

• Random Matrices, Intrinsic Freeness, and Sharp Non-Asymptotic Inequalities
• Random Matrices
• Lectures on random matrix models. The Riemann-Hilbert approach
• Universality and sharp matrix concentration inequalities
• Quantitative estimates of the spectral norm of random matrices with independent columns