Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 80 tok/s
Gemini 2.5 Pro 60 tok/s Pro
GPT-5 Medium 23 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 87 tok/s Pro
Kimi K2 173 tok/s Pro
GPT OSS 120B 433 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

Eigenvalue rigidity for truncations of random unitary matrices (1905.02233v1)

Published 6 May 2019 in math.PR, math-ph, and math.MP

Abstract: We consider the empirical eigenvalue distribution of an $m\times m$ principal submatrix of an $n\times n$ random unitary matrix distributed according to Haar measure. For $n$ and $m$ large with $\frac{m}{n}=\alpha$, the empirical spectral measure is well-approximated by a deterministic measure $\mu_\alpha$ supported on the unit disc. In earlier work, we showed that for fixed $n$ and $m$, the bounded-Lipschitz distance between the empirical spectral measure and the corresponding $\mu_\alpha$ is typically of order $\sqrt{\frac{\log(m)}{m}}$ or smaller. In this paper, we consider eigenvalues on a microscopic scale, proving concentration inequalities for the eigenvalue counting function and for individual bulk eigenvalues.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.