English

Hard edge tail asymptotics

Probability 2011-11-21 v2

Abstract

Let Λ\Lambda be the limiting smallest eigenvalue in the general (\beta, a)-Laguerre ensemble of random matrix theory. Here \beta>0, a >-1; for \beta=1,2,4 and integer a, this object governs the singular values of certain rank n Gaussian matrices. We prove that P(\Lambda > \lambda) = e^{- (\beta/2) \lambda + 2 \gamma \lambda^{1/2}} \lambda^{- (\gamma(\gamma+1))/(2\beta) + \gamma/4} E (\beta, a) (1+o(1)) as \lambda goes to infinity, in which \gamma = (\beta/2) (a+1)-1 and E(\beta, a) is a constant (which we do not determine). This estimate complements/extends various results previously available for special values of \beta and a.

Keywords

Cite

@article{arxiv.1109.4121,
  title  = {Hard edge tail asymptotics},
  author = {Jose A. Ramirez and Brian Rider and Ofer Zeitouni},
  journal= {arXiv preprint arXiv:1109.4121},
  year   = {2011}
}

Comments

Minor revision; to appear in Elec. Comm. Probability

R2 v1 2026-06-21T19:07:20.845Z