Recursion for the smallest eigenvalue density of $\beta$-Wishart-Laguerre ensemble
Santosh Kumar

TL;DR
This paper develops a recurrence scheme for the smallest eigenvalue density in the $eta$-Wishart-Laguerre ensemble, extending previous methods to non-integer $eta$ and integer $ ext{alpha}$, enabling efficient computation and analysis of spectral properties.
Contribution
The authors extend recurrence relations for the smallest eigenvalue density to $eta$-Wishart-Laguerre ensembles with non-negative integer $ ext{alpha}$ and arbitrary positive $eta$, facilitating explicit calculations.
Findings
Recurrence scheme for $eta$-Wishart-Laguerre ensembles with non-integer $eta$.
Explicit evaluation of smallest eigenvalue density for large matrix sizes.
Comparison with Tracy-Widom and large deviation results confirms accuracy.
Abstract
The statistics of the smallest eigenvalue of Wishart-Laguerre ensemble is important from several perspectives. The smallest eigenvalue density is typically expressible in terms of determinants or Pfaffians. These results are of utmost significance in understanding the spectral behavior of Wishart-Laguerre ensembles and, among other things, unveil the underlying universality aspects in the asymptotic limits. However, obtaining exact and explicit expressions by expanding determinants or Pfaffians becomes impractical if large dimension matrices are involved. For the real matrices () Edelman has provided an efficient recurrence scheme to work out exact and explicit results for the smallest eigenvalue density which does not involve determinants or matrices. Very recently, an analogous recurrence scheme has been obtained for the complex matrices (). In the present work we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
