Explore a 40-minute lecture on the minimal rank of submatrices in random rectangular matrices. Delve into the intriguing properties of n by N matrices with independent identically distributed random entries. Discover how the relationship between n and N affects the invertibility of square submatrices. Learn about the proof of Feige and Lellouche's conjecture regarding the minimal rank of these submatrices. Gain insights into advanced matrix theory and probability concepts through this in-depth mathematical exploration presented by Mark Rudelson at the Hausdorff Center for Mathematics.
Minimal Rank of Submatrices of Random Rectangular Matrices
Hausdorff Center for Mathematics via YouTube
Overview
Syllabus
Mark Rudelson: Minimal rank of submatrices of a random rectangular matrix
Taught by
Hausdorff Center for Mathematics
Related Courses
-
Approximately Hadamard Matrices and Random Frames
-
Quantitative Invertibility of Non-Hermitian Random Matrices
-
Two-Sided Estimates for Operator ℓp to ℓq Norms of Random Matrices with IID Entries
-
Finding Low-Rank Matrices - From Matrix Completion to Recent Trends
-
Consequences of the Random Matrix Solution to the Peterson-Thom Conjecture
-
Delocalization of Eigenvectors of Large Random Matrices
