Speaker: 

Nicholas Cook

Institution: 

UCLA

Time: 

Tuesday, November 7, 2017 - 11:00am to 11:50am

Host: 

Location: 

RH 306

The invertibility of random matrices with iid entries has been the object of intense study over the past decade, due in part to its role in proving the circular law, as well as its importance in numerical analysis (smoothed analysis). In this talk we review recent progress in our understanding of invertibility for some non-iid models: adjacency matrices of sparse random regular digraphs, and random matrices with inhomogeneous variance profile. We will also discuss estimates for the number of singular values in short intervals. Graph regularity properties play a key role in both problems. Based in part on joint works with Walid Hachem, Jamal Najim, David Renfrew, Anirban Basak and Ofer Zeitouni.