arXiv subjects

Jack W. Silverstein

Publications and source records attributed to Jack W. Silverstein.

18 recordsLinked to original sources

arXiv2023

Exact Separation of Eigenvalues of Large Dimensional Noncentral Sample Covariance Matrices

Let $ \bbB_n =\frac{1}{n}(\bbR_n + \bbT^{1/2}_n \bbX_n)(\bbR_n + \bbT^{1/2}_n \bbX_n)^* $ where $ \bbX_n $ is a $ p \times n $ matrix with independent standardized random variables, $ \bbR_n $ is a $ p \times n $ non-random matrix, representing the information, and $ \bbT_{n} $ is a $ p \times p $ non-random nonnegative definite Hermitian matrix. Under some conditions on $ \bbR_n \bbR_n^* $ and $ \bbT_n $, it has been proved that for any closed interval outside the support of the limit spectral distribution, with probability one there will be no eigenvalues falling in this interval for all $ p $ sufficiently large. The purpose of this paper is to carry on with the study of the support of the limit spectral distribution, and we show that there is an exact separation phenomenon: with probability one, the proper number of eigenvalues lie on either side of these intervals.

math.PR↗

arXiv2023

Analysis of the limiting spectral distribution of large dimensional General information-plus-noise type matrices

In this paper, we derive the analytical behavior of the limiting spectral distribution of non-central covariance matrices of the "general information-plus-noise" type, as studied in [14]. Through the equation defining its Stieltjes transform, it is shown that the limiting distribution has a continuous derivative away from zero, the derivative being analytic wherever it is positive, and we show the determination criterion for its support. We also extend the result in [14] to allow for all possible ratios of row to column of the underlying random matrix.

math.ST↗

arXiv2023

No Eigenvalues Outside the Support of the Limiting Spectral Distribution of Large Dimensional noncentral Sample Covariance Matrices

Let $ \bbB_n =\frac{1}{n}(\bbR_n + \bbT^{1/2}_n \bbX_n)(\bbR_n + \bbT^{1/2}_n \bbX_n)^* $, where $ \bbX_n $ is a $ p \times n $ matrix with independent standardized random variables, $ \bbR_n $ is a $ p \times n $ non-random matrix and $ \bbT_{n} $ is a $ p \times p $ non-random, nonnegative definite Hermitian matrix. The matrix $\bbB_n$ is referred to as the information-plus-noise type matrix, where $\bbR_n$ contains the information and $\bbT^{1/2}_n \bbX_n$ is the noise matrix with the covariance matrix $\bbT_{n} $. It is known that, as $ n \to \infty $, if $ p/n $ converges to a positive number, the empirical spectral distribution of $ \bbB_n $ converges almost surely to a nonrandom limit, under some mild conditions. In this paper, we prove that, under certain conditions on the eigenvalues of $ \bbR_n $ and $ \bbT_n $, for any closed interval outside the support of the limit spectral distribution, with probability one there will be no eigenvalues falling in this interval for all $ n $ sufficiently large.

math.PR↗

arXiv2021

Weak Convergence of a Collection of Random Functions Defined by the Eigenvectors of Large Dimensional Random Matrices

For each $n$, let $U_n$ be Haar distributed on the group of $n\times n$ unitary matrices. Let $\bfx_{n,1},\ldots,\bfx_{n,m} $ denote orthogonal nonrandom unit vectors in ${\Bbb C}^n$ and let $\text{\bf u}_{n,k}=(u_k^1,\ldots,u_k^n)^*=U^*\text{\bf x}_{n,k}$, $k=1,\ldots,m$. Define the following functions on [0,1]: $X^{k,k}_n(t)=\sqrt n\sum_{i=1}^{[nt]}(|u_k^i|^2-\tfrac1n)$, $X_n^{k,k'}(t)=\sqrt{2n}\sum_{i=1}^{[nt]}\bar u_k^iu_{k'}^i$, $k 0$ as $n\to\infty$. This result extends the result in J.W. Silverstein {\sl Ann. Probab. \bf18} 1174-1194. These results are applied to the detection problem in sampling random vectors mostly made of noise and detecting whether the sample includes a nonrandom vector.

math.PR↗

arXiv2021

Limiting Eigenvalue Behavior of a Class of Large Dimensional Random Matrices Formed From a Hadamard Product

This paper investigates the strong limiting behavior of the eigenvalues of the class of matrices $\frac1N(D_n\circ X_n)(D_n\circ X_n)^*$, studied in Girko 2001. Here, $X_n=(x_{ij})$ is an $n\times N$ random matrix consisting of independent complex standardized random variables, $D_n=(d_{ij})$, $n\times N$, has nonnegative entries, and $\circ$ denotes Hadamard (componentwise) product. Results are obtained under assumptions on the entries of $X_n$ and $D_n$ which are different from those in Girko (2001), which include a Lindeberg condition on the entries of $D_n\circ X_n$, as well as a bound on the average of the rows and columns of $D_n\circ D_n$. The present paper separates the assumptions needed on $X_n$ and $D_n$. It assumes a Lindeberg condition on the entries of $X_n$, along with a tigntness-like condition on the entries of $D_n$,

math.PR↗

arXiv2021

Local Convergence of an AMP Variant to the LASSO Solution in Finite Dimensions

A common sparse linear regression formulation is the l1 regularized least squares, which is also known as least absolute shrinkage and selection operator (LASSO). Approximate message passing (AMP) has been proved to asymptotically achieve the LASSO solution when the regression matrix has independent and identically distributed (i.i.d.) Gaussian entries in the sense that the averaged per-coordinate l2 distance between the AMP iterates and the LASSO solution vanishes as the signal dimension goes to infinity before the iteration number. However, in finite dimensional settings, characterization of AMP iterates in the limit of large iteration number has not been established. In this work, we propose an AMP variant by including a parameter that depends on the largest singular value of the regression matrix. The proposed algorithm can also be considered as a primal dual hybrid gradient algorithm with adaptive stepsizes. We show that whenever the AMP variant converges, it converges to the LASSO solution for arbitrary finite dimensional regression matrices. Moreover, we show that the AMP variant is locally stable around the LASSO solution under the condition that the LASSO solution is unique and that the regression matrix is drawn from a continuous distribution. Our local stability result implies that in the special case where the regression matrix is large and has i.i.d. random entries, the original AMP, which is a special case of the proposed AMP variant, is locally stable around the LASSO solution.

cs.IT↗

arXiv2019

Singular values of large non-central random matrices

We study largest singular values of large random matrices, each with mean of a fixed rank $K$. Our main result is a limit theorem as the number of rows and columns approach infinity, while their ratio approaches a positive constant. It provides a decomposition of the largest $K$ singular values into the deterministic rate of growth, random centered fluctuations given as explicit linear combinations of the entries of the matrix, and a term negligible in probability. We use this representation to establish asymptotic normality of the largest singular values for random matrices with means that have block structure. We also deduce asymptotic normality for the largest eigenvalues of the normalized covariance matrix arising in a model of population genetics.

math.PR↗

arXiv2017

Separation of the largest eigenvalues in eigenanalysis of genotype data from discrete subpopulations

We present a mathematical model, and the corresponding mathematical analysis, that justifies and quantifies the use of principal component analysis of biallelic genetic marker data for a set of individuals to detect the number of subpopulations represented in the data. We indicate that the power of the technique relies more on the number of individuals genotyped than on the number of markers.

q-bio.PE↗

arXiv2014

Robust Estimates of Covariance Matrices in the Large Dimensional Regime

This article studies the limiting behavior of a class of robust population covariance matrix estimators, originally due to Maronna in 1976, in the regime where both the number of available samples and the population size grow large. Using tools from random matrix theory, we prove that, for sample vectors made of independent entries having some moment conditions, the difference between the sample covariance matrix and (a scaled version of) such robust estimator tends to zero in spectral norm, almost surely. This result can be applied to various statistical methods arising from random matrix theory that can be made robust without altering their first order behavior.

cs.IT↗

arXiv2013

The Random Matrix Regime of Maronna's M-estimator with elliptically distributed samples

This article demonstrates that the robust scatter matrix estimator $\hat{C}_N\in {\mathbb C}^{N\times N}$ of a multivariate elliptical population $x_1,\ldots,x_n\in {\mathbb C}^N$ originally proposed by Maronna in 1976, and defined as the solution (when existent) of an implicit equation, behaves similar to a well-known random matrix model in the limiting regime where the population $N$ and sample $n$ sizes grow at the same speed. We show precisely that $\hat{C}_N\in{\mathbb C}^{N\times N}$ is defined for all $n$ large with probability one and that, under some light hypotheses, $\Vert \hat{C}_N-\hat{S}_N\Vert\to 0$ almost surely in spectral norm, where $\hat{S}_N$ follows a classical random matrix model. As a corollary, the limiting eigenvalue distribution of $\hat{C}_N$ is derived. This analysis finds applications in the fields of statistical inference and signal processing.

math.PR↗

arXiv2013

A note on the CLT of the LSS for sample covariance matrix from a spiked population model

In this note, we establish an asymptotic expansion for the centering parameter appearing in the central limit theorems for linear spectral statistic of large-dimensional sample covariance matrices when the population has a spiked covariance structure. As an application, we provide an asymptotic power function for the corrected likelihood ratio statistic for testing the presence of spike eigenvalues in the population covariance matrix. This result generalizes an existing formula from the literature where only one simple spike exists.

math.PR↗

arXiv2011

A CLT for Information-theoretic statistics of Non-centered Gram random matrices

In this article, we study the fluctuations of the random variable: $$ {\mathcal I}_n(ρ) = \frac 1N \log\det(Σ_n Σ_n^* + ρI_N),\quad (ρ>0) $$ where $Σ_n= n^{-1/2} D_n^{1/2} X_n\tilde D_n^{1/2} +A_n$, as the dimensions of the matrices go to infinity at the same pace. Matrices $X_n$ and $A_n$ are respectively random and deterministic $N\times n$ matrices; matrices $D_n$ and $\tilde D_n$ are deterministic and diagonal, with respective dimensions $N\times N$ and $n\times n$; matrix $X_n=(X_{ij})$ has centered, independent and identically distributed entries with unit variance, either real or complex. We prove that when centered and properly rescaled, the random variable ${\mathcal I}_n(ρ)$ satisfies a Central Limit Theorem and has a Gaussian limit. The variance of ${\mathcal I}_n(ρ)$ depends on the moment $\E X_{ij}^2$ of the variables $X_{ij}$ and also on its fourth cumulant $κ= \E|X_{ij}|^4 - 2 - |\E X_{ij}^2|^2$. The main motivation comes from the field of wireless communications, where ${\mathcal I}_n(ρ)$ represents the mutual information of a multiple antenna radio channel. This article closely follows the companion article "A CLT for Information-theoretic statistics of Gram random matrices with a given variance profile", {\em Ann. Appl. Probab. (2008)} by Hachem et al., however the study of the fluctuations associated to non-centered large random matrices raises specific issues, which are addressed here.

math.PR↗

arXiv2010

Eigen-Inference for Energy Estimation of Multiple Sources

In this paper, a new method is introduced to blindly estimate the transmit power of multiple signal sources in multi-antenna fading channels, when the number of sensing devices and the number of available samples are sufficiently large compared to the number of sources. Recent advances in the field of large dimensional random matrix theory are used that result in a simple and computationally efficient consistent estimator of the power of each source. A criterion to determine the minimum number of sensors and the minimum number of samples required to achieve source separation is then introduced. Simulations are performed that corroborate the theoretical claims and show that the proposed power estimator largely outperforms alternative power inference techniques.

cs.IT↗

arXiv2010

A Deterministic Equivalent for the Analysis of Correlated MIMO Multiple Access Channels

In this article, novel deterministic equivalents for the Stieltjes transform and the Shannon transform of a class of large dimensional random matrices are provided. These results are used to characterise the ergodic rate region of multiple antenna multiple access channels, when each point-to-point propagation channel is modelled according to the Kronecker model. Specifically, an approximation of all rates achieved within the ergodic rate region is derived and an approximation of the linear precoders that achieve the boundary of the rate region as well as an iterative water-filling algorithm to obtain these precoders are provided. An original feature of this work is that the proposed deterministic equivalents are proved valid even for strong correlation patterns at both communication sides. The above results are validated by Monte Carlo simulations.

cs.IT↗

arXiv2009

Fundamental limit of sample generalized eigenvalue based detection of signals in noise using relatively few signal-bearing and noise-only samples

The detection problem in statistical signal processing can be succinctly formulated: Given m (possibly) signal bearing, n-dimensional signal-plus-noise snapshot vectors (samples) and N statistically independent n-dimensional noise-only snapshot vectors, can one reliably infer the presence of a signal? This problem arises in the context of applications as diverse as radar, sonar, wireless communications, bioinformatics, and machine learning and is the critical first step in the subsequent signal parameter estimation phase. The signal detection problem can be naturally posed in terms of the sample generalized eigenvalues. The sample generalized eigenvalues correspond to the eigenvalues of the matrix formed by "whitening" the signal-plus-noise sample covariance matrix with the noise-only sample covariance matrix. In this article we prove a fundamental asymptotic limit of sample generalized eigenvalue based detection of signals in arbitrarily colored noise when there are relatively few signal bearing and noise-only samples. Numerical simulations highlight the accuracy of our analytical prediction and permit us to extend our heuristic definition of the effective number of identifiable signals in colored noise. We discuss implications of our result for the detection of weak and/or closely spaced signals in sensor array processing, abrupt change detection in sensor networks, and clustering methodologies in machine learning.

cs.IT↗

arXiv2007

Gaussian fluctuations for non-Hermitian random matrix ensembles

Consider an ensemble of $N\times N$ non-Hermitian matrices in which all entries are independent identically distributed complex random variables of mean zero and absolute mean-square one. If the entry distributions also possess bounded densities and finite $(4+ε)$ moments, then Z. D. Bai [Ann. Probab. 25 (1997) 494--529] has shown the ensemble to satisfy the circular law: after scaling by a factor of $1/\sqrt{N}$ and letting $N\to \infty$, the empirical measure of the eigenvalues converges weakly to the uniform measure on the unit disk in the complex plane. In this note, we investigate fluctuations from the circular law in a more restrictive class of non-Hermitian matrices for which higher moments of the entries obey a growth condition. The main result is a central limit theorem for linear statistics of type $X_N(f)=\sum_{k=1}^Nf(λ_k)$ where $λ_1,λ_2,...,λ_N$ denote the ensemble eigenvalues and the test function $f$ is analytic on an appropriate domain. The proof is inspired by Bai and Silverstein [Ann. Probab. 32 (2004) 533--605], where the analogous result for random sample covariance matrices is established.

math.PR↗

arXiv2007

On the signal-to-interference ratio of CDMA systems in wireless communications

Let $\{s_{ij}:i,j=1,2,...\}$ consist of i.i.d. random variables in $\mathbb{C}$ with $\mathsf{E}s_{11}=0$, $\mathsf{E}|s_{11}|^2=1$. For each positive integer $N$, let $\mathbf{s}_k={\mathbf{s}}_k(N)=(s_{1k},s_{2k},...,s_{Nk})^T$, $1\leq k\leq K$, with $K=K(N)$ and $K/N\to c>0$ as $N\to\infty$. Assume for fixed positive integer $L$, for each $N$ and $k\leq K$, ${\boldsα}_k=(α_k(1),...,α_k(L))^T$ is random, independent of the $s_{ij}$, and the empirical distribution of $(α_1,...,α_K)$, with probability one converging weakly to a probability distribution $H$ on $\mathbb{C}^L$. Let ${\boldsβ}_k={\boldsβ}_k(N)=(α_k(1)\mathbf{s}_k^T,...,α_k(L)\m athbf{s}_k^T)^T$ and set $C=C(N)=(1/N)\sum_{k=2}^K{\bolds β}_k{\bolds β}_k^*$. Let $σ^2>0$ be arbitrary. Then define $SIR_1=(1/N){\boldsβ}^*_1(C+σ^2I)^{-1}{\boldsβ}_1$, which represents the best signal-to-interference ratio for user 1 with respect to the other $K-1$ users in a direct-sequence code-division multiple-access system in wireless communications. In this paper it is proven that, with probability 1, $SIR_1$ tends, as $N\to\infty$, to the limit $\sum_{\ell,\ell'=1}^L\barα_1(\ell) alpha_1(\ell')a_{\ell,\ell'},$ where $A=(a_{\ell,\ell'})$ is nonrandom, Hermitian positive definite, and is the unique matrix of such type satisfying $A=\bigl(c \mathsf{E}\frac{{\boldsα}{\bolds α}^*}{1+{\boldsα}^*A{\boldsα}}+σ^2I_L\bigr)^{-1}$, where ${\boldsα}\in \mathbb{C}^L$ has distribution $H$. The result generalizes those previously derived under more restricted assumptions.

math.PR↗

arXiv2004

Eigenvalues of Large Sample Covariance Matrices of Spiked Population Models

We consider a spiked population model, proposed by Johnstone, whose population eigenvalues are all unit except for a few fixed eigenvalues. The question is to determine how the sample eigenvalues depend on the non-unit population ones when both sample size and population size become large. This paper completely determines the almost sure limits for a general class of samples.

math.ST↗