Distribution of trace of inverse-Wishart matrix $W_n(I,n)$ Hello,
I'm interested in the distribution of the trace of an inverse-Wishart matrix $W_n^{-1}(I,n)$, where $I$ is $n\times n$ identity matrix. More precisely, I seek for an asymptotic estimate (when $n\to\infty$) for a function $f(n)$ such that $Pr[Tr(W)< f(n)]>2/3$, say.
What I've learned so far:


*

*I know the pdf of the eigenvalues of $W$, thus, I could use it to find the bound, but it could be tedious.

*A formula for the expectation of $W_n^{-1}(I,m)$ is known, but it does not work for $n=m$ (the expectation is infinite in this case).
This question seems pretty basic, so I expect it should have been considered before, but my google search hasn't revealed any reference on it so far. Could you help me with any?
Thank you,
Alexander.
 A: Assuming I'm interpreting your notation correctly, with high probability it is known that $\lambda_{\min}(W_n) \ge c/n$ for some absolute constant $c$ (see Edelman, "Eigenvalues and condition numbers of random matrices", or this paper by Rudelson and Vershynin for a quick summary of some more general results.
From this it follows that $Tr(W_n^{-1}) = \sum_{i=1}^n \lambda_i(W_n)^{-1} \le n^2/c$ with
high probability.  Probably the $n^2$ can be improved somewhat.  See Szarek, "Condition numbers of random matrices" for estimates on nonextreme eigenvalues which may be good enough to do better here.
Added: here's a heuristic to get an $O(n)$ bound, which as the OP notes in his answer, is best possible.  Putting the eigenvalues of $W_n$ in increasing order, we have typically $\lambda_k(W_n) \approx \frac{k^2}{n}$, from which it follows that
$$
Tr(W_n^{-1}) \lesssim \sum_{k=1}^n \frac{n}{k^2} \le n \sum_{k=1}^\infty \frac{1}{k^2}
= C n.
$$
I haven't checked the details, but the results in the paper of Szarek mentioned above are probably strong enough to make this rigorous.
A: I guess, I've done it.
My idea is to detach two eigenvalues, use the smallest eigenvalue estimation for them and then apply the known result for the expectation of the rest of the matrix.
Let $G$ be $n\times n$ matrix with entries being pairwise independent standard Gaussians. Then let $W=G^TG$ and I am interested in $Tr(W^{-1})$. I use that mine multivariate Gaussian distributions are invariant under application of (real) orthogonal matrices. Thus, the distribution does not change if I assume that $e_1$ and $e_2$ (elements of the standard basis) are eigenvectors of $W$. This means, merely, that first two columns of $G$ are orthogonal to all other columns and orthogonal to each another. Again, as orthogonal transformations does not change the distribution on $G$, this assumption does not change the distribution on the rest of the columns of $G$. Let $\lambda_1$ and $\lambda_2$ be the eigenvalues of $e_1$ and $e_2$, respectively, and let $W'$ be $W$ with first two rows and columns removed. Then $Tr(W^{-1}) = 1/\lambda_1 + 1/\lambda_2 + Tr(W'^{-1})$. I can use the estimation on the smallest eigenvalue of $W$ to bound the first two terms. Now note that $W'$ is, in fact, $W_{n-2}(I,n)$, and it is known that expectation of $W'^{-1}$ is $I$. Hence, the expectation of the trace is $n-2$. Using Markov for the third term, I get that, with high enough probability, $Tr(W^{-1})$ is $O(n)$. This cannot be improved because of the smallest eigenvalue.
I hope that's correct.
A: You have $W_n(I,n)= XX^{T}$ where $X$ is $n \times n$ with the rows of $X$ iid from $N(0,I_{n})$, so then it seems to me that as $n \rightarrow \infty$, $W_{n} \rightarrow nI_{n}$ almost surely?
This is because $X$ is almost surely an orthogonal matrix, and the entries along the trace will converge to their expectation by the strong law for iid RVs which is $E[\chi^{2}_{n}] = n$ by construction.
Edit: As noted below this answer is incorrect, but possibly the discussion below is interesting so I'll keep this post up until it starts getting downvoted.
