Tails of Random Matrix Diagonal Elements: The Case of the Wishart Inverse
Abstract: We analytically compute the large-deviation probability of a diagonal matrix element of two cases of random matrices, namely $\beta=[\vec H\dagger\vec H]{-1}_{11}$ and $\gamma=[\vec I_N+\rho\vec H\dagger\vec H]{-1}_{11}$, where $\vec H$ is a $M\times N$ complex Gaussian matrix with independent entries and $M\geq N$. These diagonal entries are related to the "signal to interference and noise ratio" (SINR) in multi-antenna communications. They depend not only on the eigenvalues but also on the corresponding eigenfunction weights, which we are able to evaluate on average constrained on the value of the SINR. We also show that beyond a lower and upper critical value of $\beta$, $\gamma$, the maximum and minimum eigenvalues, respectively, detach from the bulk. Responsible for this detachment is the fact that the corresponding eigenvalue weight becomes macroscopic (i.e. O(1)), and hence exerts a strong repulsion to the eigenvalue.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.