Complex random matrices have no real eigenvalues

From MaRDI portal
Publication:4603580

DOI10.1142/S2010326317500149zbMATH Open1390.60033arXiv1609.07679OpenAlexW2963616995MaRDI QIDQ4603580FDOQ4603580


Authors: Kyle Luh Edit this on Wikidata


Publication date: 16 February 2018

Published in: Random Matrices: Theory and Applications (Search for Journal in Brave)

Abstract: Let zeta=xi+ixi where xi,xi are iid copies of a mean zero, variance one, subgaussian random variable. Let Nn be a nimesn random matrix with entries that are iid copies of zeta. We prove that there exists a cin(0,1) such that the probability that Nn has any real eigenvalues is less than cn where c only depends on the subgaussian moment of xi. The bound is optimal up to the value of the constant c. The principal component of the proof is an optimal tail bound on the least singular value of matrices of the form Mn:=M+Nn where M is a deterministic complex matrix with the condition that |M|leqKn1/2 for some constant K depending on the subgaussian moment of xi. 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




Cites Work


Cited In (5)





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)