| Publication | Date of Publication | Type |
|---|
Eigenvalue gaps of random perturbations of large matrices
Random Matrices: Theory and Applications | 2025-11-25 | Paper |
| An improved lower bound for sparse reconstruction from subsampled Hadamard matrices | 2025-08-12 | Paper |
| Random matrices: L1 concentration and dictionary learning with few samples | 2025-08-05 | Paper |
Extreme eigenvalues of Laplacian random matrices with Gaussian entries (with an appendix by Santiago Arenas-Velilla and Victor Perez-Abreu)
Electronic Journal of Probability | 2025-08-05 | Paper |
An improved lower bound for sparse reconstruction from subsampled Walsh matrices
Discrete Analysis | 2025-07-08 | Paper |
Rate of convergence in multiple SLE using random matrix theory
Random Matrices: Theory and Applications | 2025-04-07 | Paper |
| Rate of Convergence in Multiple SLE using Random Matrix Theory | 2023-01-11 | Paper |
| Extreme eigenvalues of Laplacian random matrices with Gaussian entries | 2022-11-30 | Paper |
Tail bounds for gaps between eigenvalues of sparse random matrices
Electronic Journal of Probability | 2022-02-22 | Paper |
Circular law for random block band matrices with genuinely sublinear bandwidth
Journal of Mathematical Physics | 2021-09-06 | Paper |
Some new results in random matrices over finite fields
Journal of the London Mathematical Society | 2021-08-13 | Paper |
On the counting problem in inverse Littlewood-Offord theory
Journal of the London Mathematical Society | 2021-08-13 | Paper |
Eigenvectors and controllability of non-Hermitian random matrices and directed graphs
Electronic Journal of Probability | 2021-07-21 | Paper |
Resilience of the rank of random matrices
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
Sparse random matrices have simple spectrum
Annales de l'Institut Henri Poincaré. Probabilités et Statistiques | 2021-06-03 | Paper |
Sparse random matrices have simple spectrum
Annales de l'Institut Henri Poincaré. Probabilités et Statistiques | 2021-06-03 | Paper |
A nonuniform Littlewood-Offord inequality for all norms
Discrete Mathematics | 2021-04-28 | Paper |
Four deviations suffice for rank 1 matrices
Advances in Mathematics | 2020-12-03 | Paper |
Eigenvector delocalization for non‐Hermitian random matrices and applications
Random Structures & Algorithms | 2020-09-16 | Paper |
Optimal threshold for a random graph to be 2-universal
Transactions of the American Mathematical Society | 2019-09-26 | Paper |
| An Improved Lower Bound for Sparse Reconstruction from Subsampled Walsh Matrices | 2019-03-28 | Paper |
Complex random matrices have no real eigenvalues
Random Matrices: Theory and Applications | 2018-02-16 | Paper |
Packing loose Hamilton cycles
Combinatorics, Probability and Computing | 2017-10-27 | Paper |
Embedding large graphs into a random graph
Bulletin of the London Mathematical Society | 2017-10-24 | Paper |
Dictionary Learning With Few Samples and Matrix Concentration
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Community Detection Using Spectral Clustering on Sparse Geosocial Data
SIAM Journal on Applied Mathematics | 2013-06-06 | Paper |
