Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn the eigenvalues of truncations of random unitary matrices
105
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We consider the empirical eigenvalue distribution of an $mtimes m$ principle submatrix of an $ntimes n$ random unitary matrix distributed according to Haar measure. Earlier work of Petz and Reffy identified the limiting spectral measure if $frac{m}{n}toalpha$, as $ntoinfty$; under suitable scaling, the family ${mu_alpha}_{alphain(0,1)}$ of limiting measures interpolates between uniform measure on the unit disc (for small $alpha$) and uniform measure on the unit circle (as $alphato1$). In this note, we prove an explicit concentration inequality which shows 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. The approach is via the theory of two-dimensional Coulomb gases and makes use of a new Coulomb transport inequality due to Chafai, Hardy, and Maida.
rate research
Read More
We consider the empirical eigenvalue distribution of an $mtimes m$ principal submatrix of an $ntimes 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.
This is a brief survey of classical and recent results about the typical behavior of eigenvalues of large random matrices, written for mathematicians and others who study and use matrices but may not be accustomed to thinking about randomness.
Let $U$ be a Haar distributed matrix in $mathbb U(n)$ or $mathbb O (n)$. In a previous paper, we proved that after centering, the two-parameter process [T^{(n)} (s,t) = sum_{i leq lfloor ns rfloor, j leq lfloor ntrfloor} |U_{ij}|^2] converges in distribution to the bivariate tied-down Brownian bridge. In the present paper, we replace the deterministic truncation of $U$ by a random one, where each row (resp. column) is chosen with probability $s$ (resp. $t$) independently. We prove that the corresponding two-parameter process, after centering and normalization by $n^{-1/2}$ converges to a Gaussian process. On the way we meet other interesting convergences.
We consider the real eigenvalues of an $(N times N)$ real elliptic Ginibre matrix whose entries are correlated through a non-Hermiticity parameter $tau_Nin [0,1]$. In the almost-Hermitian regime where $1-tau_N=Theta(N^{-1})$, we obtain the large-$N$ expansion of the mean and the variance of the number of the real eigenvalues. Furthermore, we derive the limiting empirical distributions of the real eigenvalues, which interpolate the Wigner semicircle law and the uniform distribution, the restriction of the elliptic law on the real axis. Our proofs are based on the skew-orthogonal polynomial representation of the correlation kernel due to Forrester and Nagao.
Let $O(2n+ell)$ be the group of orthogonal matrices of size $left(2n+ellright)times left(2n+ellright)$ equipped with the probability distribution given by normalized Haar measure. We study the probability begin{equation*} p_{2n}^{left(ellright)} = mathbb{P}left[M_{2n} , mbox{has no real eigenvalues}right], end{equation*} where $M_{2n}$ is the $2ntimes 2n$ left top minor of a $(2n+ell)times(2n+ell)$ orthogonal matrix. We prove that this probability is given in terms of a determinant identity minus a weighted Hankel matrix of size $ntimes n$ that depends on the truncation parameter $ell$. For $ell=1$ the matrix coincides with the Hilbert matrix and we prove begin{equation*} p_{2n}^{left(1right)} sim n^{-3/8}, mbox{ when }n to infty. end{equation*} We also discuss connections of the above to the persistence probability for random Kac polynomials.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
