
arXiv: 1711.02842
In this paper, we investigate the following question: How often is a random matrix normal? We consider a random $n\times n$ matrix, $M_n$, whose entries are i.i.d. Rademacher random variables (taking values $\{ \pm1 \}$ with probability $1/2$) and prove $$2^{-\left(0.5+o(1)\right)n^2} \le P\left(M_n \text{ is normal}\right) \le 2^{-(0.302+o(1))n^{2}}. $$ We conjecture that the lower bound is sharp.
Random matrices (algebraic aspects), Probability (math.PR), random matrices, Random matrices (probabilistic aspects), normality, combinatorics, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Mathematics - Probability, Rademacher random variables
Random matrices (algebraic aspects), Probability (math.PR), random matrices, Random matrices (probabilistic aspects), normality, combinatorics, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Mathematics - Probability, Rademacher random variables
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
