On the number of real eigenvalues of a product of truncated orthogonal random matrices
Alex Little, Francesco Mezzadri, Nick Simm

TL;DR
This paper proves conjectures about the expected number and distribution of real eigenvalues of products of truncated orthogonal matrices, revealing different asymptotic behaviors depending on the relation between matrix size and truncation.
Contribution
It establishes the expected number and distribution of real eigenvalues for products of truncated orthogonal matrices, confirming conjectures and extending previous single-matrix results.
Findings
Expected real eigenvalues grow as rac{rac{2mL}{\u03c0}}{ ext{arctanh}( ext{sqrt}(rac{N}{N+L}))} for large N and proportional L.
Limiting distribution of real eigenvalues matches conjectured form.
Expected number of real eigenvalues scales as c_{L,m} rac{rac{1}{ ext{log}(N)}} for fixed L as N rac{rac{1}{ ext{log}(N)}).
Abstract
Let be chosen uniformly at random from the group of orthogonal matrices. Denote by the upper-left corner of , which we refer to as a truncation of . In this paper we prove two conjectures of Forrester, Ipsen and Kumar (2020) on the number of real eigenvalues of the product matrix , where the matrices are independent copies of . When grows in proportion to , we prove that We also prove the conjectured form of the limiting real eigenvalue distribution of the product matrix. Finally, we consider the opposite regime where is fixed with respect to , known as the regime of weak…
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
TopicsRandom Matrices and Applications · Advanced Algebra and Geometry · Graph theory and applications
