Related papers: Singular values of Gaussian matrices and permanent…
We obtain large n asymptotics for products of powers of the absolute values of the characteristic polynomials in the Gaussian Unitary Ensemble of n\times n matrices. Our results can also be interpreted as asymptotics of the determinant of a…
The paper addresses the calculation of correlation functions of permanental polynomials of matrices with random entries. By exploiting a convenient contour integral representation of the matrix permanent some explicit results are provided…
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…
Gaussian graphical models are parametric statistical models for jointly normal random variables whose dependence structure is determined by a graph. In previous work, we introduced trek separation, which gives a necessary and sufficient…
We propose methodology for statistical inference for low-dimensional parameters of sparse precision matrices in a high-dimensional setting. Our method leads to a non-sparse estimator of the precision matrix whose entries have a Gaussian…
The proportion of edges in a Gaussian graphical model (GGM) characterizes the complexity of its conditional dependence structure. Since edge presence corresponds to a nonzero entry of the precision matrix, estimation of this proportion can…
Observables in random tensor theory are polynomials in the entries of a tensor of rank $d$ which are invariant under $U(N)^d$. It is notoriously difficult to evaluate the expectations of such polynomials, even in the Gaussian distribution.…
Standard Gaussian graphical models (GGMs) implicitly assume that the conditional independence among variables is common to all observations in the sample. However, in practice, observations are usually collected form heterogeneous…
Many important problems are characterized by the eigenvalues of a large matrix. For example, the difficulty of many optimization problems, such as those arising from the fitting of large models in statistics and machine learning, can be…
We derive exact results for gap probabilities, as well as densities of extreme eigenvalues for six complex random matrix ensembles of fundamental importance. These are Gauss-Wigner, Laguerre-Wishart, Cauchy-Lorentz (two variants),…
We study the universality of the local eigenvalue statistics of Gaussian divisible Hermitian Wigner matrices. These random matrices are obtained by adding an independent GUE matrix to an Hermitian random matrix with independent elements, a…
We prove two basic conjectures on the distribution of the smallest singular value of random n times n matrices with independent entries. Under minimal moment assumptions, we show that the smallest singular value is of order n^{-1/2}, which…
The fermionic Gaussian operator basis provides a representation for treating strongly correlated fermion systems, as well as playing an important role in random matrix theory. We prove that a resolution of unity exists for any even…
In this paper, we propose a class of Bayes estimators for the covariance matrix of graphical Gaussian models Markov with respect to a decomposable graph $G$. Working with the $W_{P_G}$ family defined by Letac and Massam [Ann. Statist. 35…
We consider a class of sample covariance matrices of the form $Q=TXX^{*}T^*,$ where $X=(x_{ij})$ is an $M \times N$ rectangular matrix consisting of i.i.d entries and $T$ is a deterministic matrix satisfying $T^*T$ is diagonal. Assuming $M$…
We consider a class of sparse random matrices of the form $A_n =(\xi_{i,j}\delta_{i,j})_{i,j=1}^n$, where $\{\xi_{i,j}\}$ are i.i.d.~centered random variables, and $\{\delta_{i,j}\}$ are i.i.d.~Bernoulli random variables taking value $1$…
We obtain uniform asymptotics for polynomials orthogonal on a fixed and varying arc of the unit circle with a positive analytic weight function. We also complete the proof of the large $s$ asymptotic expansion for the Fredholm determinant…
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…
It is known that computing the permanent of the matrix $1+A$, where $A$ is a finite-rank matrix, requires a number of operations polynomial in the matrix size. Motivated by the boson-sampling proposal of restricted quantum computation, I…
We present an encoding of a polynomial system into vanishing and non-vanishing constraints on almost-principal minors of a symmetric, principally regular matrix, such that the solvability of the system over some field is equivalent to the…