1 citations · 2 across the 5 of their papers we have counts for
7 papers · 1 filter
Eigenvalue Gaps of Random Perturbations of Large Matrices
Kyle Luh, Ryan Vogel, Alan Yu
The current work applies some recent combinatorial tools due to Jain to control the eigenvalue gaps of a matrix where is deterministic, symmetric with large ope…
Eigenvectors and controllability of non-Hermitian random matrices and directed graphs
Kyle Luh, Sean O'Rourke
We study the eigenvectors and eigenvalues of random matrices with iid entries. Let be a random matrix with iid entries which have symmetric distribution. For each unit eigenvec…
Tail bounds for gaps between eigenvalues of sparse random matrices
Patrick Lopatto, Kyle Luh
We prove the first eigenvalue repulsion bound for sparse random matrices. As a consequence, we show that these matrices have simple spectrum, improving the range of sparsity and er…
Eigenvector Delocalization for Non-Hermitian Random Matrices and Applications
Kyle Luh, Sean O'Rourke
Improving upon results of Rudelson and Vershynin, we establish delocalization bounds for eigenvectors of independent-entry random matrices. In particular, we show that with high pr…
Sparse Random Matrices have Simple Spectrum
Kyle Luh, Van Vu
Let be a class of symmetric sparse random matrices, with independent entries for . are i.i.d. Bernoulli random variables taking th…
Dictionary Learning with Few Samples and Matrix Concentration
Kyle Luh, Van Vu
Let be an matrix, be an matrix and . A challenging and important problem in data analysis, motivated by dictionary learning and other prac…