Hard edge tail asymptotics

14Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Let Λ be the limiting smallest eigenvalue in the general (β, α)-Laguerre ensemble of random matrix theory. That is, Λ is the n ↑ ∞ distributional limit of the (scaled) minimal point drawn from the density proportional to ∏1≤i 0, α > −1; for β = 1, 2, 4 and integer a, this object governs the singular values of certain rank n Gaussian matrices. We prove that P(Λ > λ) = e−β/2λ+2γ√λ λ−λ(λ+1-β/2)/2β e(β, α)(1 + o(1)) as λ ↑ ∞ in which γ = β/2(a + 1) − 1 and e(β, a) > 0 is a constant (which we do not determine). This estimate complements/extends various results previously available for special values of β and a. © 2011 Association for Symbolic Logic.

Cite

CITATION STYLE

APA

Ramírez, J. A., Rider, B., & Zeitouni, O. (2011). Hard edge tail asymptotics. Electronic Communications in Probability, 16, 741–752. https://doi.org/10.1214/ECP.v16-1682

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free