Related papers: Comparison theorems for the extreme eigenvalues of…
Finding eigenvalue distributions for a number of sparse random matrix ensembles can be reduced to solving nonlinear integral equations of the Hammerstein type. While a systematic mathematical theory of such equations exists, it has not been…
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…
Ensembles of isotropic random matrices are defined by the invariance of the probability measure under the left (and right) multiplication by an arbitrary unitary matrix. We show that the multiplication of large isotropic random matrices is…
The expectation-maximization (EM) algorithm is an iterative method for finding maximum likelihood estimates when data are incomplete or are treated as being incomplete. The EM algorithm and its variants are commonly used for parameter…
We prove a large deviations principle for the largest eigenvalue of Gaussian Kronecker matrices, namely matrices defined as the sum of tensors of independent Gaussian matrices in the regime where the dimension of the Gaussian matrices goes…
The largest eigenvalue of random tensors is an important feature of systems involving disorder, equivalent to the ground state energy of glassy systems or to the injective norm of quantum states. For symmetric Gaussian random tensors of…
We give a necessary and sufficient condition for symmetric infinitely divisible distribution to have Gaussian component. The result can be applied to approximation the distribution of finite sums of random variables. Particularly, it shows…
We analyze the spectral properties of correlation matrices between distinct statistical systems. Such matrices are intrinsically non symmetric, and lend themselves to extend the spectral analyses usually performed on standard Pearson…
A polynomial matrix inequality is a formula asserting that a polynomial matrix is positive semidefinite. Polynomial matrix optimization concerns minimizing the smallest eigenvalue of a symmetric polynomial matrix subject to a tuple of…
Kontsevitch's work on Airy matrix integrals has led to explicit results for the intersection numbers of the moduli space of curves. In a subsequent work Okounkov rederived these results from the edge behavior of a Gaussian matrix integral.…
Simulating sample correlation matrices is important in many areas of statistics. Approaches such as generating Gaussian data and finding their sample correlation matrix or generating random uniform $[-1,1]$ deviates as pairwise correlations…
Statistical inferences for sample correlation matrices are important in high dimensional data analysis. Motivated by this, this paper establishes a new central limit theorem (CLT) for a linear spectral statistic (LSS) of high dimensional…
Non-Hermitian random matrices with statistical spectral characteristics beyond the standard Ginibre ensembles have recently emerged in the description of dissipative quantum many-body systems as well as in non-ergodic wave transport in…
This paper is concerned with the interplay between statistical asymmetry and spectral methods. Suppose we are interested in estimating a rank-1 and symmetric matrix $\mathbf{M}^{\star}\in \mathbb{R}^{n\times n}$, yet only a randomly…
We study the adjacency matrix of the Linial-Meshulam complex model, which is a higher-dimensional generalization of the Erd\H{o}s-R\'enyi graph model. Recently, Knowles and Rosenthal proved that the empirical spectral distribution of the…
Slepian and Sudakov-Fernique type inequalities, which compare expectations of maxima of Gaussian random vectors under certain restrictions on the covariance matrices, play an important role in probability theory, especially in empirical…
We prove two conjectures in spectral extremal graph theory involving the linear combinations of graph eigenvalues. Let $\lambda_1(G)$ be the largest eigenvalue of the adjacency matrix of a graph $G$, and $\bar{G}$ be the complement of $G$.…
Gaussian mixture models (GMMs) are ubiquitous in statistical learning, particularly for unsupervised problems. While full GMMs suffer from the overparameterization of their covariance matrices in high-dimensional spaces, spherical GMMs…
The matrix pencil method is an eigenvalue based approach for the parameter identification of sparse exponential sums. We derive a reconstruction algorithm for multivariate exponential sums that is based on simultaneous diagonalization.…
The Bonferroni adjustment, or the union bound, is commonly used to study rate optimality properties of statistical methods in high-dimensional problems. However, in practice, the Bonferroni adjustment is overly conservative. The extreme…