Efficient net estimates and the smallest singular value of random matrices

Efficient net estimates and the smallest singular value of random matrices

Efficient net estimates and the smallest singular value of random matrices

Tuesday, January 27, 2026
  • Lecturer: Galyna Livshyts, (Georgia Tech)
  • Location: Meyer building (electrical engeneering), room 861
Abstract:
We will discuss a construction of an efficient net on the high-dimensional sphere, and its applications to the questions of invertibility of large random matrices, and estimating the smallest singular value of random matrices in the non-asymptotic setting. We will focus on two novel ensembles:  inhomogeneous and log-concave random matrices.
Print to PDF