Related papers: A Simple Generalization of a Result for Random Mat…

The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…

Generalized singular values (GSVs) play an essential role in the comparative analysis. In the real world data for comparative analysis, both data matrices are usually numerically low-rank. This paper proposes a randomized algorithm to first…

For sample covariance matrices with iid entries with sub-Gaussian tails, when both the number of samples and the number of variables become large and the ratio approaches to one, it is a well-known result of A. Soshnikov that the limiting…

We consider consecutive random subdivision of polygons described as follows. Given an initial convex polygon with $d\ge 3$ edges, we choose a point at random on each edge, such that the proportions in which these points divide edges are…

For general non-Gaussian distributions, the covariance and precision matrices do not encode the independence structure of the variables, as they do for the multivariate Gaussian. This paper builds on previous work to show that for a class…

A discrete-time stochastic process derived from a model of basketball is used to generalize any discrete distribution. The generalized distributions can have one or two more parameters than the parent distribution. Those derived from…

This paper expands the analysis of randomized low-rank approximation beyond the Gaussian distribution to four classes of random matrices: (1) independent sub-Gaussian entries, (2) independent sub-Gaussian columns, (3) independent bounded…

We address the construction of stable random matrix ensembles as the generalization of the stable random variables (Levy distributions). With a simple method we derive the Cauchy case, which is known to have remarkable properties. These…

A generalized definition of the determinant of matrices is given, which is compatible with the usual determinant for square matrices and keeps many important properties, such as being an alternating multilinear function, keeping…

Random matrix theory (RMT) is based on two assumptions: (1) matrix-element independence, and (2) base invariance. Most of the proposed generalizations keep the first assumption and violate the second. Recently, several authors presented…

In this note we generalize the trace inequality derived by [1] to the case where the number of terms of the sum (denoted by K) is arbitrary.

We improve and expand in two directions the theory of norms on complex matrices induced by random vectors. We first provide a simple proof of the classification of weakly unitarily invariant norms on the Hermitian matrices. We use this to…

We study the distribution of entries of a random permutation matrix under a "randomized basis," i.e., we conjugate the random permutation matrix by an independent random orthogonal matrix drawn from Haar measure. It is shown that under…

In this paper, we give an elementary proof of the additivity of the functional inverses of the resolvents of large $N$ random matrices, using recently developed matrix model techniques. This proof also gives a very natural generalization of…

We consider the joint distribution of real and imaginary parts of eigenvalues of random matrices with independent real entries with mean zero and unit variance. We prove the convergence of this distribution to the uniform distribution on…

We generalize the Wedderburn rank reduction formula by replacing the inverse with the Moore--Penrose pseudoinverse. In particular, this allows one to remove the non--singularity of a certain matrix from assumptions. The results implies in a…

Random matrices tend to be well conditioned, and we employ this well known property to advance matrix computations. We prove that our algorithms employing Gaussian random matrices are efficient, but in our tests the algorithms have…

It is a classical result of Wigner that for an hermitian matrix with independent entries on and above the diagonal, the mean empirical eigenvalue distribution converges weakly to the semicircle law as matrix size tends to infinity. In this…

The letter presents a method for the reduction in the mutual coherence of an overcomplete Gaussian or Bernoulli random matrix, which is fairly small due to the lower bound given here on the probability of the event that the aforesaid mutual…

We show that the operatorial framework developed by Voiculescu for free random variables can be extended to arrays of random variables whose multiplication imitates matricial multiplication. The associated notion of independence, called…