Back to results

Massachusetts Institute of Technology

Quantitative invertibility of random matrices : a combinatorial perspective

Abstract

dc:description.abstract

In this thesis, we develop a novel framework for investigating the lower tail behavior of the least singular value of random matrices - a subject which has been intensely studied in the past two decades. Our focus is on obtaining high probability bounds, rather than on estimating the least singular value of a 'typical' realisation of the random matrix. In our main application, we consider random matrices of the form Mn := M + Nn, where M is a fixed complex matrix with operator norm at most exp(Nc), and Nn is a random matrix, each of whose entries is an independent copy of a complex random variable with mean 0 and variance 1. This setting, with some additional restrictions, has been previously considered in a series of influential works by Tao and Vu, most notably in connection with the strong circular law, and the smoothed analysis of the condition number, and our results extend and improve upon theirs in a couple of ways. As opposed to all previous works obtaining such bounds with error rate better than n-1, our proof makes no use either of the inverse Littlewood-Offord theorems, or of any sophisticated net constructions. Instead, we show how to reduce the optimization problem characterizing the smallest singular value from the (complex) sphere to (Gaussian) integer vectors, where it is solved using direct combinatorial arguments.

Degree

thesis:*
Name thesis:degree_name
Doctoral
Department dc:contributor.department
Massachusetts Institute of Technology. Department of Mathematics
Grantor dc:publisher
Massachusetts Institute of Technology
Year dc:date.issued
2020

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Jain, Vishesh.
Advisor dc:contributor.advisor
  • Elchanan Mossel.

Subjects

dc:subject × 1

Rights

dc:rights
Statement dc:rights
  • MIT theses may be protected by copyright. Please reuse MIT thesis content according to the MIT Libraries Permissions Policy, which is available through the URL provided.
Language dc:language.iso
eng

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/1721.1/128637
OAI identifier oai:identifier
oai:dspace.mit.edu:1721.1/128637

Chain of custody

source
Harvested from
MIT
Base URL
dspace.mit.edu/oai/request
Last updated
2026-07-22
Source record
OAI-PMH GetRecord
related terms
citation

Jain, Vishesh.. Quantitative invertibility of random matrices : a combinatorial perspective. Massachusetts Institute of Technology, 2020. https://hdl.handle.net/1721.1/128637