# Math Picture Language Seminar: Nonasymptotic random matrix theory

MATHEMATICAL PICTURE LANGUAGE, SEMINARS

##### Speaker:

Ramon van Hande *- Princeton University*

Suppose we are given a random matrix with an essentially arbitrary pattern of entry means and variances, dependencies, and distributions. What can we say about its spectrum? It may appear hopeless that anything useful can be proved at this level of generality, which lies far outside the scope of classical random matrix theory. The aim of my talk is to describe the basic ingredients of a new theory that provides sharp nonasymptotic information on the spectrum in an extremely general setting. This is made possible by an unexpected phenomenon: under surprisingly minimal assumptions, the spectrum of an arbitrarily structured random matrix is accurately captured by that of an associated deterministic operator that arises from free probability theory.

(Based on joint works with Afonso Bandeira, March Boedihardjo, and Tatiana Brailovskaya.)

https://harvard.zoom.us/j/779283357?pwd=MitXVm1pYUlJVzZqT3lwV2pCT1ZUQT09