Related papers: Comparison theorems for the extreme eigenvalues of…

Let $A$ be a real skew-symmetric Gaussian random matrix whose upper triangular elements are independently distributed according to the standard normal distribution. We provide the distribution of the largest singular value $\sigma_1$ of…

In this paper, we use a new approach to prove that the largest eigenvalue of the sample covariance matrix of a normally distributed vector is bigger than the true largest eigenvalue with probability 1 when the dimension is infinite. We…

We show that, under mild assumptions, the spectrum of a sum of independent random matrices is close to that of the Gaussian random matrix whose entries have the same mean and covariance. This nonasymptotic universality principle yields…

Positive semi-definite matrices commonly occur as normal matrices of least squares problems in statistics or as kernel matrices in machine learning and approximation theory. They are typically large and dense. Thus algorithms to solve…

In this paper, we show that the diagonal of a high-dimensional sample covariance matrix stemming from $n$ independent observations of a $p$-dimensional time series with finite fourth moments can be approximated in spectral norm by the…

We consider a Gaussian rotationally invariant ensemble of random real totally symmetric tensors with independent normally distributed entries, and estimate the largest eigenvalue of a typical tensor in this ensemble by examining the rate of…

In this paper, on the sublinear expectation space, we establish a comparison theorem between independent and convolutionary random vectors, which states that the partial sums of those two sequences of random vectors are identically…

This article presents maximum likelihood estimators (MLEs) and log-likelihood ratio (LLR) tests for the eigenvalues and eigenvectors of Gaussian random symmetric matrices of arbitrary dimension, where the observations are independent…

We investigate the statistics of the largest eigenvalue, $\lambda_{\rm max}$, in an ensemble of $N\times N$ large ($N\gg 1$) sparse adjacency matrices, $A_N$. The most attention is paid to the distribution and typical fluctuations of…

We study the largest eigenvalue of a Gaussian random symmetric matrix $X_n$, with zero-mean, unit variance entries satisfying the condition $\sup_{(i, j) \ne (i', j')}|\mathbb{E}[X_{ij} X_{i'j'}]| = O(n^{-(1 + \varepsilon)})$, where…

Random matrix theory has played an important role in various areas of pure mathematics, mathematical physics, and machine learning. From a practical perspective of data science, input data are usually normalized prior to processing. Thus,…

There has been an increasing interest in testing the equality of large Pearson's correlation matrices. However, in many applications it is more important to test the equality of large rank-based correlation matrices since they are more…

This paper deals with symmetric random matrices whose upper diagonal entries are obtained from a linear random field with heavy tailed noise. It is shown that the maximum eigenvalue and the spectral radius of such a random matrix with…

This paper is aimed at deriving the universality of the largest eigenvalue of a class of high-dimensional real or complex sample covariance matrices of the form $\mathcal{W}_N=\Sigma^{1/2}XX^*\Sigma ^{1/2}$. Here, $X=(x_{ij})_{M,N}$ is an…

This paper gives a rigorous proof of a conjectured statistical self-similarity property of the eigenvalues random matrices from the Circular Unitary Ensemble. We consider on the one hand the eigenvalues of an $n \times n$ CUE matrix, and on…

Euclidean random matrices arise in a wide range of physical systems where interactions are determined by spatial configurations, including disordered media and cooperative phenomena in atomic ensembles. Unlike classical random matrix…

For a graph G, M(G) denotes the maximum multiplicity occurring of an eigenvalue of a symmetric matrix whose zero-nonzero pattern is given by edges of G. We introduce two combinatorial graph parameters T^-(G) and T^+(G) that give a lower and…

Given a symmetric matrix $A$, we show from the simple sketch $GAG^T$, where $G$ is a Gaussian matrix with $k = O(1/\epsilon^2)$ rows, that there is a procedure for approximating all eigenvalues of $A$ simultaneously to within $\epsilon…

We study random matrices with independent subgaussian columns. Assuming each column has a fixed Euclidean norm, we establish conditions under which such matrices act as near-isometries when restricted to a given subset of their domain. We…

Random-matrix theory is applied to transition-rate matrices in the Pauli master equation. We study the distribution and correlations of eigenvalues, which govern the dynamics of complex stochastic systems. Both the cases of identical and of…