Search arXivSearch

arXiv · 1306.6566

Three Problems Related to the Eigenvalues of Complex Non-central Wishart Matrices with a Rank-1 Mean

Abstract

Recently, D. Wang has devised a new contour integral based method to simplify certain matrix integrals. Capitalizing on that approach, we derive a new expression for the probability density function (p.d.f.) of the joint eigenvalues of a complex non-central Wishart matrix with a rank-1 mean. The resulting functional form in turn enables us to use powerful classical orthogonal polynomial techniques in solving three problems related to the non-central Wishart matrix. To be specific, for an $n\times n$ complex non-central Wishart matrix $\mathbf{W}$ with $m$ degrees of freedom ($m\geq n$) and a rank-1 mean, we derive a new expression for the cumulative distribution function (c.d.f.) of the minimum eigenvalue ($\lambda_{\min}$). The c.d.f. is expressed as the determinant of a square matrix, the size of which depends only on the difference $m-n$. This further facilitates the analysis of the microscopic limit for the minimum eigenvalue which takes the form of the determinant of a square matrix of size $m-n$ with the Bessel kernel. We also develop a moment generating function based approach to derive the p.d.f. of the random variable $\frac{\text{tr}(\mathbf{W})}{\lambda_{\min}}$, where $\text{tr}(\cdot)$ denotes the trace of a square matrix. This random quantity is of great importance in the so-called smoothed analysis of Demmel condition number. Finally, we find the average of the reciprocal of the characteristic polynomial $\det[z\mathbf{I}_n+\mathbf{W}],\; |\arg z|<\pi$, where $\mathbf{I}_n$ and $\det[\cdot]$ denote the identity matrix of size $n$ and the determinant, respectively.

Explore related subjects

Keep this discovery

BibTeXRIS

Prathapasinghe Dharmawansa. 2013-06-27. Three Problems Related to the Eigenvalues of Complex Non-central Wishart Matrices with a Rank-1 Mean. https://arxiv.org/abs/1306.6566

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A Scale Invariance Property of PCA

The PCA algorithm is sensitive to changes in measurement scale. Measuring one variable of a system in inches rather than centimeters, say, alters both its principal axes and principal eigenvalues. Although this scale dependence is generally complicated, we show here that it nevertheless obeys a strict invariance property: under a continuous scale adjustment, the initial state's $k$-th largest principal component (ordered by eigenvalue) continuously evolves into the final state's $k$-th largest principal component, for each $k$. In this sense, we can say that the modes of PCA are "order-stable" with respect to changes in measurement scale. A special case occurs when scaling along directions that are orthogonal to some modes. Here, apparent eigenvalue crossings can occur. However, we show that we can interpret these apparent crossings as cases where the modes instantaneously swap their orientation, in this way maintaining the required order stability.

math.ST

Small noise asymptotics for linear parabolic SPDEs in two space dimensions with unknown damping factors

We study parametric estimation for second order linear parabolic stochastic partial differential equations in two space dimensions with a small volatility parameter driven by a $Q$-Wiener process with an unknown damping parameter using high frequency spatio-temporal data. We first provide an estimator for the damping parameter of the $Q$-Wiener process utilizing realized quadratic variations based on spatial and temporal increments. We next propose minimum contrast estimators of the diffusive and advective parameters in the SPDE using a contrast function with the proposed estimator of the damping parameter. We then construct a quasi-maximum likelihood estimator of the reaction parameter in the SPDE using the approximate coordinate process derived from the estimators of the diffusive and advective parameters. We also provide simulation results of the proposed estimators.

math.ST

Spike Estimation from Heteroscedastic Noise via Random Splitting

In this paper, we consider a spiked Wigner type matrix with a heteroscedastic and unknown variance profile. It is well known that in the supercritical regime of the BBP transition, strong spikes can create outliers in the spectrum. Unfortunately, in the heteroscedastic case, in general it is not possible to estimate the spike strength from these observed outlier consistently, as the latter is a solution to a Dyson equation with unknown parameters from the variance profile. In this paper, inspired by the work on sparse matrix completion \citep{BordenaveCosteNadakuditi2023}, we introduce an asymmetrized model by randomly splitting the spiked matrix into two parts, which transforms the noisy Wigner type matrix into a non Hermitian random matrix, while preserving the Hermitian spikes at the cost of a dilution. We establish a BBP type transition for the asymmetrized model, from which we can estimate the strength of the spikes precisely, even without knowing the variance profile of the noise part. We then further apply our approach to study the correlation between two correlated spiked models, where the spike/signal parts of the two models are correlated, and the noise parts are independent but may both be heteroscedastic. By applying our asymmetrization approach to the two models separately and also jointly, we are able to obtain a precise estimate of the correlation between the signal parts of the two models.

math.ST