Abstract
In this chapter, we shall apply the previous general results on concentration inequalities to random matrix theory, in particular to the eigenvalues of random matrices. To this end, we shall first study the regularity of the eigenvalues of matrices as a function of their entries (since the idea will be to apply concentration inequalities to the entries of the random matrices and then see the eigenvalues as nice functions of these entries).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Guionnet, A. (2009). Concentration inequalities for random matrices. In: Large Random Matrices: Lectures on Macroscopic Asymptotics. Lecture Notes in Mathematics(), vol 1957. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69897-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-69897-5_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69896-8
Online ISBN: 978-3-540-69897-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)