Printable PDF
Department of Mathematics,
University of California San Diego

****************************

Math 243 - Functional Analysis Seminar

Felix Parraud

KTH Royal Institute of Technology (Stockholm)

Free probability and random matrices: the asymptotic behaviour of polynomials in independent random matrices

Abstract:

It has been known for a long time that as their size grow to infinity, many models of random matrices behave as free operators. This link was first explicited by Voiculescu in 1991 in a paper in which he proved that the trace of polynomials in independent GUE matrices converges towards the trace of the same polynomial evaluated in free semicircular variables. In 2005, Haagerup and Thorbjornsen proved the convergence of the norm instead of the trace. The main difficulty of their proof was to prove a sharp enough upper bound of the difference between the trace of random matrices and their free limit. They managed to do so with the help of the so-called linearization trick which allows to relate the spectrum of a polynomial of any degree with scalar coefficients with a polynomial of degree 1 with matrix coefficients. A drawback of this method is that it does not give easily good quantitative estimates. In arXiv:1912.04588, we introduced a new strategy to approach those questions which does not rely on the linearization trick and instead is based on free stochastic calculus. In this talk, I will first focus on the paper arXiv:2011.04146, in which we proved an asymptotic expansion for traces of smooth functions evaluated in independent GUE random matrices, whose coefficients are defined through free probability. And then I will talk about arXiv:2005.1383, in which we adapted the previous method to the case of Haar unitary matrices.

Host: David Jekel

November 2, 2021

11:00 AM

On Zoom. Please email djekel@ucsd.edu for details.

****************************