Answers are grounded in this paper and cite their sources.
This paper calculates the fluctuations of eigenvalues of polynomials on large Haar unitaries cut by finite rank deterministic matrices. When the eigenvalues are all simple, we can give a complete algorithm for computing the fluctuations. When multiple eigenvalues are involved, we present several examples suggesting that a general algorithm would be much more complex.
No takes yet. Share an insight, caveat, or question.
Collins et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: