Singularity of random symmetric matrices revisited
Research output: Contribution to journal › Article › peer-review
Colleges, School and Institutes
Let Mn be drawn uniformly from all ±1 symmetric n×n matrices. We show that the probability that Mn is singular is at most exp(−c(nlogn)1/2), which represents a natural barrier in recent approaches to this problem. In addition to improving on the best-known previous bound of Campos, Mattos, Morris and Morrison of exp(−cn1/2) on the singularity probability, our method is different and considerably simpler.
Not yet published as of 26/08/2021.
|Journal||Proceedings of the American Mathematical Society|
|Publication status||Accepted/In press - 3 Aug 2021|
- math.PR, math.CO