相关论文: On the Smallest Eigenvalue of General correlated G…

We establish, under a moment matching hypothesis, the local universality of the correlation functions associated with products of $M$ independent iid random matrices, as $M$ is fixed, and the sizes of the matrices tend to infinity. This…

We consider an $n\times n$ matrix of independent real Gaussian random variables and determine the asymptotic distribution of the smallest gaps between complex eigenvalues.

This thesis reviews recent progress on products of random matrices from the perspective of exactly solved Gaussian random matrix models. We derive exact formulae for the correlation functions for the eigen- and singular values at arbitrary…

We obtain a tail bound for the least non-zero singular value of $A-z$ when $A$ is a random matrix and $z$ is an eigenvalue of $A$ in a neighbourhood of a given point $z_0$ in the bulk of the spectrum. The argument relies on a resolvent…

We study the Gaussian hermitian random matrix ensemble with an external matrix which has an arbitrary number of eigenvalues with arbitrary multiplicity. We compute the limiting eigenvalues correlations when the size of the matrix goes to…

The Collective Graphical Model (CGM) models a population of independent and identically distributed individuals when only collective statistics (i.e., counts of individuals) are observed. Exact inference in CGMs is intractable, and previous…

We study the joint spectral properties of two coupled random matrices $H^{(1)}$ and $H^{(2)}$, which are either real symmetric or complex Hermitian. The entries of these matrices exhibit polynomially decaying correlations, both within each…

This paper studies the extreme gaps between eigenvalues of random matrices. We give the joint limiting law of the smallest gaps for Haar-distributed unitary matrices and matrices from the Gaussian unitary ensemble. In particular, the kth…

The Restricted Invertibility problem is the problem of selecting the largest subset of columns of a given matrix $X$, while keeping the smallest singular value of the extracted submatrix above a certain threshold. In this paper, we address…

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…

This paper studies the asymptotic behavior of eigenvalues of random abelian G-circulant matrices, that is, matrices whose structure is related to a finite abelian group G in a way that naturally generalizes the relationship between…

A Laplacian matrix is a real symmetric matrix whose row and column sums are zero. We investigate the limiting distribution of the largest eigenvalues of a Laplacian random matrix with Gaussian entries. Unlike many classical matrix…

We apply random matrix theory to complex networks. We show that nearest neighbor spacing distribution of the eigenvalues of the adjacency matrices of various model networks, namely scale-free, small-world and random networks follow…

Let $A$ be an $N\times n$ random matrix whose entries are coordinates of an isotropic log-concave random vector in $\mathbb{R}^{Nn}$. We prove sharp lower tail estimates for the smallest singular value of $A$ in the following cases: (1)…

This paper studies the problem of estimating a covariance matrix from correlated sub-Gaussian samples. We consider using the correlated sample covariance matrix estimator to approximate the true covariance matrix. We establish…

We consider the problem of large-scale inference on the row or column variables of data in the form of a matrix. Often this data is transposable, meaning that both the row variables and column variables are of potential interest. An example…

This paper establishes a comparison theorem for the maximum eigenvalue of a sum of independent random symmetric matrices. The theorem states that the maximum eigenvalue of the matrix sum is dominated by the maximum eigenvalue of a Gaussian…

Spectral correlations in unitary invariant, non-Gaussian ensembles of large random matrices possessing an eigenvalue gap are studied within the framework of the orthogonal polynomial technique. Both local and global characteristics of…

Random matrix theory allows one to deduce the eigenvalue spectrum of a large matrix given only statistical information about its elements. Such results provide insight into what factors contribute to the stability of complex dynamical…

We analyze statistical properties of the complex system with conditions which manifests through specific constraints on the column/row sum of the matrix elements. The presence of additional constraints besides symmetry leads to new…