Polynomials in Asymptotically Free Random Matrices

Abstract

Recent work of Belinschi, Mai and Speicher resulted in a general algorithm to calculate the distribution of any selfadjoint polynomial in free variables. Since many classes of independent random matrices become asymptotically free if the size of the matrices goes to infinity, this algorithm allows then also the calculation of the asymptotic eigenvalue distribution of polynomials in such independent random matrices. We will recall the main ideas of this approach and then also present its extension to the case of the Brown measure of non-selfadjoint polynomials.

Talk given at the conference "Random Matrix Theory: Foundations and Applications" in Krakow, Poland 2014

Cited by in corpus (6)

• Eigenvalues of non-hermitian random matrices and Brown measure of non-normal operators: hermitian reduction and linearization method
• Eigenvector statistics of the product of Ginibre matrices
• Realizations of non-commutative rational functions around a matrix centre, I: synthesis, minimal realizations and evaluation on stably finite algebras
• Limiting Spectral Distributions of Sums of Products of Non-Hermitian Random Matrices
• Spatio-Temporal Big Data Analysis for Smart Grids Based on Random Matrix Theory: A Comprehensive Study
• A Novel Approach for Big Data Analytics in Future Grids Based on Free Probability