Abstract
For positive integers $s, n$ let $M_s = (1/s)V_sV^T_s$, where $V_s$ is an $n \\times s$ matrix composed of i.i.d. $N(0, 1)$ random variables. Assume $n = n(s)$ and $n/s \\rightarrow y \\in (0, 1)$ as $s \\rightarrow \\infty$. Then it is shown that the smallest eigenvalue of $M_s$ converges almost surely to $(1 - \\sqrt y)^2$ as $s \\rightarrow \\infty$.
Keywords
Related Publications
A Limit Theorem for the Norm of Random Matrices
This paper establishes an almost sure limit for the operator norm of rectangular random matrices: Suppose $\\{v_{ij}\\}i = 1,2, \\cdots, j = 1,2, \\cdots$ are zero mean i.i.d. r...
Limit of the Smallest Eigenvalue of a Large Dimensional Sample Covariance Matrix
In this paper, the authors show that the smallest (if $p \\leq n$) or the $(p - n + 1)$-th smallest (if $p > n$) eigenvalue of a sample covariance matrix of the form $(1/n)XX...
Laws of Large Numbers for Sums of Extreme Values
Let $X_1, X_2, \\cdots$, be a sequence of nonnegative i.i.d. random variables with common distribution $F$, and for each $n \\geq 1$ let $X_{1n} \\leq \\cdots \\leq X_{nn}$ deno...
For most large underdetermined systems of linear equations the minimal 𝓁<sub>1</sub>‐norm solution is also the sparsest solution
Abstract We consider linear equations y = Φ x where y is a given vector in ℝ n and Φ is a given n × m matrix with n < m ≤ τ n , and we wish to solve for x ∈ ℝ m . We suppose ...
A Strong Law for Some Generalized Urn Processes
Let $f$ be a continuous function from the unit interval to itself and let $X_0, X_1, \\cdots$ be the successive proportions of red balls in an urn to which at the $n$th stage a ...
Publication Info
- Year
- 1985
- Type
- article
- Volume
- 13
- Issue
- 4
- Citations
- 254
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1214/aop/1176992819