Subcritical multiplicative chaos for regularized counting statistics from random matrix theory
Gaultier Lambert, Dmitry Ostrovsky, Nick Simm

TL;DR
This paper proves that the exponential of a counting statistic for eigenvalues of random unitary matrices converges to a Gaussian multiplicative chaos measure, revealing universality and advancing understanding of mesoscopic eigenvalue fluctuations.
Contribution
It establishes the convergence of the regularized counting field to a Gaussian multiplicative chaos measure in the subcritical phase and demonstrates universality across different point processes.
Findings
Convergence of the exponential of counting fields to Gaussian multiplicative chaos.
Moments of total mass converge to a Selberg-like integral.
Supports universality of the limiting object across different processes.
Abstract
For an random unitary matrix , we consider the random field defined by counting the number of eigenvalues of in a mesoscopic arc of the unit circle, regularized at an -dependent scale . We prove that the renormalized exponential of this field converges as to a Gaussian multiplicative chaos measure in the whole subcritical phase. In addition, we show that the moments of the total mass converge to a Selberg-like integral and by taking a further limit as the size of the arc diverges, we establish part of the conjectures in \cite{Ost16}. By an analogous construction, we prove that the multiplicative chaos measure coming from the sine process has the same distribution, which strongly suggests that this limiting object should be universal. The proofs are based on the asymptotic analysis of certain Toeplitz or Fredholm determinants using…
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.
