Related papers: Singular values of Gaussian matrices and permanent…
Let $\a$ be a complex random variable with mean zero and bounded variance. Let $N_{n}$ be the random matrix of size $n$ whose entries are iid copies of $\a$ and $M$ be a fixed matrix of the same size. The goal of this paper is to give a…
In this paper, we derive a unified method for establishing the distributional convergence of linear eigenvalue statistics (LES) for generalized patterned random matrices. We prove that for an $N \times N$ generalized patterned random matrix…
The classical Gaussian ensembles of random matrices can be constructed by maximizing Boltzmann-Gibbs-Shannon's entropy, S_{BGS} = - \int d{\bf H} [P({\bf H})] \ln [P({\bf H})], with suitable constraints. Here we construct and analyze…
We perform a non-asymptotic analysis on the singular vector distribution under Gaussian noise. In particular, we provide sufficient conditions on a matrix for its first few singular vectors to have near normal distribution. Our result can…
We derive exact analytic expressions for the distributions of eigenvalues and singular values for the product of an arbitrary number of independent rectangular Gaussian random matrices in the limit of large matrix dimensions. We show that…
For a specific class of sparse Gaussian graphical models, we provide a closed-form solution for the determinant of the covariance matrix. In our framework, the graphical interaction model (i.e., the covariance selection model) is equal to…
Consider a $N\times n$ matrix $\Sigma_n=\frac{1}{\sqrt{n}}R_n^{1/2}X_n$, where $R_n$ is a nonnegative definite Hermitian matrix and $X_n$ is a random matrix with i.i.d. real or complex standardized entries. The fluctuations of the linear…
In this paper we extend earlier work on groups acting on Gaussian graphical models to Gaussian Bayesian networks and more general Gaussian models defined by chain graphs. We discuss the maximal group which leaves a given model invariant and…
We introduce efficient Markov chain Monte Carlo methods for inference and model determination in multivariate and matrix-variate Gaussian graphical models. Our framework is based on the G-Wishart prior for the precision matrix associated…
Joint distribution function of N eigenvalues of U(N) invariant random-matrix ensemble can be interpreted as a probability density to find N fictitious non-interacting fermions to be confined in a one-dimensional space. Within this picture a…
We refine Osserman's argument on the exceptional values of the Gauss map of algebraic minimal surfaces. This gives an effective estimate for the number of exceptional values and the totally ramified value number for a wider class of…
We propose a contour integral-based algorithm for computing a few singular values of a matrix or a few generalized singular values of a matrix pair. Mathematically, the generalized singular values of a matrix pair are the eigenvalues of an…
We show that a formalism proposed by Creutz to evaluate Grassmann integrals provides an algorithm of complexity $O(2^n n^3)$ to compute the generating function for the sum of the permanental minors of a matrix of order $n$. This algorithm…
Let $n,k\geq 1$ and let $G$ be the $n\times n$ random matrix with i.i.d. standard real Gaussian entries. We show that there are constants $c_k,C_k>0$ depending only on $k$ such that the smallest singular value of $G^k$ satisfies $$…
In this paper, we investigate extreme singular values of the analysis matrix of a Gabor frame $(g, \Lambda)$ with a random window $g$. Columns of such matrices are time and frequency shifts of $g$, and $\Lambda\subset…
We study the fluctuations of eigenvalues from a class of Wigner random matrices that generalize the Gaussian orthogonal ensemble. We begin by considering an $n \times n$ matrix from the Gaussian orthogonal ensemble (GOE) or Gaussian…
We show that the eigenvalue density of a product X=X_1 X_2 ... X_M of M independent NxN Gaussian random matrices in the large-N limit is rotationally symmetric in the complex plane and is given by a simple expression rho(z,\bar{z}) =…
It has been observed that the performances of many high-dimensional estimation problems are universal with respect to underlying sensing (or design) matrices. Specifically, matrices with markedly different constructions seem to achieve…
In this paper we consider an asymptotic question in the theory of the Gaussian Unitary Ensemble of random matrices. In the bulk scaling limit, the probability that there are no eigenvalues in the interval (0,2s) is given by P_s=det(I-K_s),…
In this note, we define a Gaussian probability distribution over matrices. We prove some useful properties of this distribution, namely, the fact that marginalization, conditioning, and affine transformations preserve the matrix Gaussian…