arXiv Analytics

Sign in

arXiv:1711.02842 [math.PR]AbstractReferencesReviewsResources

Random matrices: Probability of Normality

Andrei Deneanu, Van Vu

Published 2017-11-08Version 1

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.

Related articles: Most relevant | Search more
arXiv:1402.3283 [math.PR] (Published 2014-02-13, updated 2014-05-29)
Threshold state and a conjecture of Poghosyan, Poghosyan, Priezzhev and Ruelle
arXiv:1106.0105 [math.PR] (Published 2011-06-01)
A Proof of a Conjecture by Mecke for STIT tessellations
arXiv:1003.0334 [math.PR] (Published 2010-03-01)
A lower bound on the critical parameter of interlacement percolation in high dimension