Random matrices have simple spectrum

DOI10.1007/s00493-016-3363-4zbMath1399.60008arXiv1412.1438OpenAlexW2962795976MaRDI QIDQ1677622

Van H. Vu, Terence C. Tao

Publication date: 10 November 2017

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.1438

zbMATH Keywords

spectrummatrices

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random matrices (probabilistic aspects) (60B20) Combinatorial probability (60C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random matrices (algebraic aspects) (15B52)

Related Items (30)

Unlocking the walk matrix of a graph ⋮ On Hosoya's dormants and sprouts ⋮ Random quantum graphs ⋮ Almost equitable partitions and new necessary conditions for network controllability ⋮ The robust minimal controllability problem ⋮ A note on species richness and the variance of epidemic severity ⋮ Upper Hessenberg and Toeplitz Bohemians ⋮ The robust minimal controllability and observability problem ⋮ On a Conjecture of Godsil Concerning Controllable Random Graphs ⋮ Bifurcations in Nagumo equations on graphs and Fiedler vectors ⋮ The least singular value of a random symmetric matrix ⋮ On the multiplicities of digraph eigenvalues ⋮ Spectral Clustering via Adaptive Layer Aggregation for Multi-Layer Networks ⋮ On the number of integral graphs ⋮ Random matrices: probability of normality ⋮ Low-degree factors of random polynomials ⋮ Eigenvectors of random matrices of symmetric entry distributions ⋮ A new perspective on the average mixing matrix ⋮ Random matrices: tail bounds for gaps between eigenvalues ⋮ On the eigenvalues distribution in threshold graphs ⋮ Determinants of Seidel matrices and a conjecture of Ghorbani ⋮ Sparse random matrices have simple spectrum ⋮ Recent progress in combinatorial random matrix theory ⋮ Eigenvectors and controllability of non-Hermitian random matrices and directed graphs ⋮ Eigenvectors of random matrices: A survey ⋮ Upper Hessenberg and Toeplitz Bohemian matrix sequences: a note on their asymptotical eigenvalues and singular values ⋮ On the real Davies' conjecture ⋮ Tail bounds for gaps between eigenvalues of sparse random matrices ⋮ The characteristic polynomial of a random matrix ⋮ An ensemble of high rank matrices arising from tournaments

Cites Work

• Optimal inverse Littlewood-Offord theorems
• Spectral statistics of Erdős-Rényi graphs II: eigenvalue spacing and the extreme eigenvalues
• Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
• A sharp inverse Littlewood-Offord theorem

This page was built for publication: Random matrices have simple spectrum