Hard edge asymptotics of correlation functions between singular values and eigenvalues
Matthias Allard

TL;DR
This paper derives the large $n$ asymptotics of the joint probability density between one eigenvalue and multiple singular values near the origin for certain random matrix ensembles, revealing universal behaviors at the hard edge.
Contribution
It provides explicit large $n$ asymptotics of the $1,k$-point function at the hard edge for polynomial and Pólya ensembles, including classical Wishart-Laguerre, Jacobi, and Cauchy-Lorentz ensembles.
Findings
Universal asymptotic behavior at the hard edge for multiple ensembles.
Same asymptotics for Wishart-Laguerre, Jacobi, and Cauchy-Lorentz ensembles.
Explicit asymptotics at the soft-hard edge for Jacobi ensembles.
Abstract
Any square complex matrix of size can be partially characterized by its eigenvalues and/or singular values. While no one-to-one correspondence exists between those two kinds of values on a deterministic level, for random complex matrices drawn from a bi-unitarily invariant ensemble, a bijection exists between the underlying singular value ensemble and the corresponding eigenvalue ensemble. This enabled the recent finding of an explicit formula for the joint probability density between eigenvalue and singular values, coined -point function. We derive here the large asymptotic of the -point function around the origin (hard edge) for a large subclass of bi-unitarily invariant ensembles called polynomial ensembles and its subclass P\'olya ensembles. This latter subclass contains all Meijer-G ensembles and, in particular, Muttalib-Borodin ensembles…
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.
Taxonomy
Topicsadvanced mathematical theories · Mathematical Dynamics and Fractals
