Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Spectral Moments of Random Matrices with a Rank-One Pattern of Variances (1409.5396v4)

Published 18 Sep 2014 in math.PR and math.CO

Abstract: Let $\mathbf{a}{ij}$, $1\leq i\leq j\leq n$, be independent random variables and $\mathbf{a}{ji}=\mathbf{a}{ij}$, for all $i,j$. Suppose that every $\mathbf{a}{ij}$ is bounded, has zero mean, and its variance is given by $\sigma_{i}\sigma_{j}$, for a given sequence of positive real numbers $\Psi={\sigma_{i} , i\in\mathbb{N}}$. Hence, the matrix of variances $V_n=\left( \mbox{Var}( \mathbf{a}{ij}) \right){i,j=1}n$ has rank one for all $n$. We show that the empirical spectral distribution of the symmetric random matrix $\mathbf{A}n(\Psi)$ $ =$ $ \left( \mathbf{a}{ij}/\sqrt{n}\right)_{i,j=1}n$ converges weakly (and with probability one) to a deterministic limiting spectral distribution which we fully characterize by providing closed-form expressions for its limiting spectral moments in terms of the sequence $\Psi$. Furthermore, we propose a hierarchy of semidefinite programs to compute upper and lower bound on the expected spectral norm of $\mathbf{A}_n$, for both finite $n$ and the limit $n\to\infty$.

Summary

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