Self-similarity in the circular unitary ensemble
Elizabeth S. Meckes, Mark W. Meckes

TL;DR
This paper rigorously proves a conjectured self-similarity property of eigenvalues in the Circular Unitary Ensemble, showing that eigenvalues of different matrix sizes are statistically indistinguishable at certain scales.
Contribution
It provides the first rigorous proof of the self-similarity conjecture for CUE eigenvalues using a novel comparison theorem for determinantal point processes.
Findings
Eigenvalues of large CUE matrices exhibit self-similarity at mesoscopic scales.
Eigenvalues of smaller and larger CUE matrices are statistically indistinguishable after appropriate scaling.
The proof introduces a new comparison theorem for determinantal point processes.
Abstract
This paper gives a rigorous proof of a conjectured statistical self-similarity property of the eigenvalues random matrices from the Circular Unitary Ensemble. We consider on the one hand the eigenvalues of an CUE matrix, and on the other hand those eigenvalues of an CUE matrix with , rescaled to fill the unit circle. We show that for a large range of mesoscopic scales, these collections of points are statistically indistinguishable for large . The proof is based on a comparison theorem for determinantal point processes which may be of independent interest.
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.
