Random matrices: probability of normality
From MaRDI portal
Abstract: In this paper, we investigate the following question: How often is a random matrix normal? We consider a random matrix, , whose entries are i.i.d. Rademacher random variables (taking values with probability ) and prove 2^{-left(0.5+o(1)
ight)n^2} le Pleft(M_n ext{ is normal}
ight) le 2^{-(0.302+o(1))n^{2}}. We conjecture that the lower bound is sharp.
Recommendations
Cites work
- scientific article; zbMATH DE number 3245540 (Why is no real title available?)
- On subspaces spanned by random selections of \(\pm 1\) vectors
- On the Probability That a Random ± 1-Matrix Is Singular
- On the singularity probability of discrete random matrices
- On the singularity probability of random Bernoulli matrices
- Random matrices have simple spectrum
- Random matrices: tail bounds for gaps between eigenvalues
Cited in
(7)- Recent progress in combinatorial random matrix theory
- Normal Vector of a Random Hyperplane
- Resilience of the rank of random matrices
- Norms of randomized circulant matrices
- scientific article; zbMATH DE number 7203492 (Why is no real title available?)
- Random symmetric matrices: rank distribution and irreducibility of the characteristic polynomial
- On the number of Hadamard matrices via anti-concentration
This page was built for publication: Random matrices: probability of normality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1731579)