arXiv:1504.00396math.PR
Random matrices: tail bounds for gaps between eigenvalues
Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.
Abstract
Gaps (or spacings) between consecutive eigenvalues are a central topic in random matrix theory. The goal of this paper is to study the tail distribution of these gaps in various random matrix models. We give the first repulsion bound for random matrices with discrete entries and the first super-polynomial bound on the probability that a random graph has simple spectrum, along with several applications.
Not to shit on all of your middlebrow dismissals but mathematicians are known to steal language from other fields as metaphors for mathematical phenomena. Sometimes these metaphors are very rigorous and precise and sometimes they're fast and loose. Here, look, I found all these…
danharajView on HNParent context