Complex random matrices have no real eigenvalues
From MaRDI portal
Publication:4603580
DOI10.1142/S2010326317500149zbMATH Open1390.60033arXiv1609.07679OpenAlexW2963616995MaRDI QIDQ4603580FDOQ4603580
Authors: Kyle Luh
Publication date: 16 February 2018
Published in: Random Matrices: Theory and Applications (Search for Journal in Brave)
Abstract: Let where are iid copies of a mean zero, variance one, subgaussian random variable. Let be a random matrix with entries that are iid copies of . We prove that there exists a such that the probability that has any real eigenvalues is less than where only depends on the subgaussian moment of . The bound is optimal up to the value of the constant . The principal component of the proof is an optimal tail bound on the least singular value of matrices of the form where is a deterministic complex matrix with the condition that for some constant depending on the subgaussian moment of . For this class of random variables, this result improves on the results of Pan-Zhou and Rudelson-Vershynin. In the proof of the tail bound, we develop an optimal small-ball probability bound for complex random variables that generalizes the Littlewood-Offord theory developed by Tao-Vu and Rudelson-Vershynin.
Full work available at URL: https://arxiv.org/abs/1609.07679
Recommendations
- What is the probability that a large random matrix has no real eigenvalues?
- The probability that a random real Gaussian matrix has \(k\) real eigenvalues, related distributions, and the circular law
- On delocalization of eigenvectors of random non-Hermitian matrices
- Smallest singular value of a random rectangular matrix
- Random matrices: The distribution of the smallest singular values
Cites Work
- The probability that a random real Gaussian matrix has \(k\) real eigenvalues, related distributions, and the circular law
- Eigenvalue statistics of random real matrices
- From the Littlewood-Offord problem to the Circular Law: Universality of the spectral distribution of random matrices
- Eigenvalues and Condition Numbers of Random Matrices
- Title not available (Why is that?)
- How Many Eigenvalues of a Random Matrix are Real?
- Numerical inverting of matrices of high order
- Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
- Bounds on the concentration function in terms of the Diophantine approximation
- The Littlewood-Offord problem and invertibility of random matrices
- Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
- Smoothed analysis of algorithms
- Smallest singular value of a random rectangular matrix
- The Probability That a Numerical Analysis Problem is Difficult
- Title not available (Why is that?)
- Random matrices: universality of local spectral statistics of non-Hermitian matrices
- The Littlewood-Offord problem in high dimensions and a conjecture of Frankl and Füredi
- A sharp inverse Littlewood-Offord theorem
- On the Probability That a Random ± 1-Matrix Is Singular
- Circular law, extreme singular values and potential theory
- Smooth analysis of the condition number and the least singular value
- On the efficiency of algorithms of analysis
- Real eigenvalues of non-Gaussian random matrices and their products
- Real eigenvalue statistics for products of asymmetric real Gaussian matrices
- Recent developments in non-asymptotic theory of random matrices
Cited In (5)
- Quantitative invertibility of random matrices: a combinatorial perspective
- The strong circular law: A combinatorial view
- Eigenvector delocalization for non‐Hermitian random matrices and applications
- Eigenvectors and controllability of non-Hermitian random matrices and directed graphs
- Quantitative invertibility of non-Hermitian random matrices
This page was built for publication: Complex random matrices have no real eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4603580)