The eigenvalue density for members of the Gaussian orthogonal and unitary ensembles follows the Wigner semicircle law. If the Gaussian entries are all shifted by a constant amount s (2N)1 2, where N is the size of the matrix, in the large N limit a single eigenvalue will separate from the support of the Wigner semicircle provided s>1. In this study, using an asymptotic analysis of the secular equation for the eigenvalue condition, we compare this effect to analogous effects occurring in general variance Wishart matrices and matrices from the shifted mean chiral ensemble. We undertake an analogous comparative study of eigenvalue separation properties when the sizes of the matrices are fixed and s→∞, and higher rank analogs of this setting. This is done using exact expressions for eigenvalue probability densities in terms of generalized hypergeometric functions and using the interpretation of the latter as a Green function in the Dyson Brownian motion model. For the shifted mean Gaussian unitary ensemble an...
In the mathematics literature the problem of the statistical properties of the largest eigenvalue of ) in the case that all entries of @math are equal to @math was first studied by F "uredi and Komlos @cite_40 . In the more general setting of real Wigner matrices (independent entries i.i.d. with mean @math and variance @math ) the distribution of the largest eigenvalue was identified as a Gaussian, so generalizing the result of Lang. Only in recent years did the associated phase transition problem, already known to @cite_17 , receive attention in the mathematical literature. In the case of the GUE, this was due to Pech 'e @cite_12 , while a rigorous study of the GOE case can be found in the work of Maida @cite_18 .
@cite_40 @cite_18 @cite_12 @cite_17
2031603583 2963919656 2079985400 2097968528
We establish a large deviation principle for the largest eigenvalue of a rank one deformation of a matrix from the GUE or GOE. As a corollary, we get another proof of the phenomenon, well-known in learning theory and finance, that the largest eigenvalue separates from the bulk when the perturbation is large enough. A large part of the paper is devoted to an auxiliary result on the continuity of spherical integrals in the case when one of the matrix is of rank one, as studied in one of our previous works. The largest eigenvalue of a matrix is always larger or equal than its largest diagonal entry. We show that for a class of random Laplacian matrices with independent off-diagonal entries, this bound is essentially tight: the largest eigenvalue is, up to lower order terms, often the size of the largest diagonal. entry. Besides being a simple tool to obtain precise estimates on the largest eigenvalue of a class of random Laplacian matrices, our main result settles a number of open problems related to the tightness of certain convex relaxation-based algorithms. It easily implies the optimality of the semidefinite relaxation approaches to problems such as ( Z _2 ) Synchronization and stochastic block model recovery. Interestingly, this result readily implies the connectivity threshold for Erdős–Renyi graphs and suggests that these three phenomena are manifestations of the same underlying principle. The main tool is a recent estimate on the spectral norm of matrices with independent entries by van Handel and the author. We consider the asymptotic fluctuation behavior of the largest eigenvalue of certain sample covariance matrices in the asymptotic regime where both dimensions of the corresponding data matrix go to infinity. More precisely, let X be an n x p matrix, and let its rows be i.i.d. complex normal vectors with mean 0 and covariance Σ p . We show that for a large class of covariance matrices £ p, the largest eigenvalue of X*X is asymptotically distributed (after recentering and rescaling) as the Tracy-Widom distribution that appears in the study of the Gaussian unitary ensemble. We give explicit formulas for the centering and scaling sequences that are easy to implement and involve only the spectral distribution of the population covariance, n and p. The main theorem applies to a number of covariance models found in applications. For example, well-behaved Toeplitz matrices as well as covariance matrices whose spectral distribution is a sum of atoms (under some conditions on the mass of the atoms) are among the models the theorem can handle. Generalizations of the theorem to certain spiked versions of our models and a.s. results about the largest eigenvalue are given. We also discuss a simple corollary that does not require normality of the entries of the data matrix and some consequences for applications in multivariate statistics. We continue the study of the Hermitian random matrix ensemble with external source Open image in new window where A has two distinct eigenvalues ±a of equal multiplicity. This model exhibits a phase transition for the value a=1, since the eigenvalues of M accumulate on two intervals for a>1, and on one interval for 0 1 was treated in Part I, where it was proved that local eigenvalue correlations have the universal limiting behavior which is known for unitarily invariant random matrices, that is, limiting eigenvalue correlations are expressed in terms of the sine kernel in the bulk of the spectrum, and in terms of the Airy kernel at the edge. In this paper we establish the same results for the case 0<a<1. As in Part I we apply the Deift Zhou steepest descent analysis to a 3×3-matrix Riemann-Hilbert problem. Due to the different structure of an underlying Riemann surface, the analysis includes an additional step involving a global opening of lenses, which is a new phenomenon in the steepest descent analysis of Riemann-Hilbert problems.