Related papers: Small deviations of determinants of random matrice…

Products of random $2\times 2$ matrices exhibit Gaussian fluctuations around almost surely convergent Lyapunov exponents. In this paper, the distribution of the random matrices is supported by a small neighborhood of order $\lambda>0$ of…

A random matrix is likely to be well conditioned, and motivated by this well known property we employ random matrix multipliers to advance some fundamental matrix computations. This includes numerical stabilization of Gaussian elimination…

In this paper we examine the deviations from Gaussianity for two types of random variable converging to a normal distribution, namely sums of random variables generated by a deterministic discrete time map and a linearly damped variable…

We analyze statistical properties of complex eigenvalues of random matrices $\hat{A}$ close to unitary. Such matrices appear naturally when considering quantized chaotic maps within a general theory of open linear stationary systems with…

We find the probability of two gaps of the form $(sc,sb)\cup (sa,+\infty)$, $c<b<a<0$, for large $s>0$, in the edge scaling limit of the Gaussian Unitary Ensemble of random matrices, including the multiplicative constant in the asymptotics.

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.…

Let $X$ be a symmetric, isotropic random vector in $\mathbb{R}^m$ and let $X_1...,X_n$ be independent copies of $X$. We show that under mild assumptions on $\|X\|_2$ (a suitable thin-shell bound) and on the tail-decay of the marginals…

We consider quadratic forms of deterministic matrices $A$ evaluated at the random eigenvectors of a large $N \times N$ GOE or GUE matrix, or equivalently evaluated at the columns of a Haar-orthogonal or Haar-unitary random matrix. We prove…

This paper is concerned with the problem of approximating the determinant of A for a large sparse symmetric positive definite matrix A. It is shown that an efficient solution of this problem is obtained by using a sparse approximate inverse…

Given a real matrix A with n columns, the problem is to approximate the Gram product AA^T by c << n weighted outer products of columns of A. Necessary and sufficient conditions for the exact computation of AA^T (in exact arithmetic) from c…

We estimate the norms of standard Gaussian random Toeplitz and circulant matrices and their inverses, mostly by means of combining some basic techniques of linear algebra. In the case of circulant matrices we obtain sharp probabilistic…

We investigate the Gaussian small ball probabilities with random centers, find their deterministic a.s.-equivalents and establish a relation to infinite-dimensional high-resolution quantization.

In distributed optimization and distributed numerical linear algebra, we often encounter an inversion bias: if we want to compute a quantity that depends on the inverse of a sum of distributed matrices, then the sum of the inverses does not…

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…

We consider n by n real matrices whose entries are non-degenerate random variables that are independent but non necessarily identically distributed, and show that the probability that such a matrix is singular is O(1/sqrt{n}). The purpose…

Random matrices have played an important role in many fields including machine learning, quantum information theory and optimization. One of the main research focuses is on the deviation inequalities for eigenvalues of random matrices.…

We investigate the small deviation probabilities of a class of very smooth stationary Gaussian processes playing an important role in Bayesian statistical inference. Our calculations are based on the appropriate modification of the entropy…

Large H-selfadjoint random matrices are considered. The matrix $H$ is assumed to have one negative eigenvalue, hence the matrix in question has precisely one eigenvalue of nonpositive type. It is showed that this eigenvalue converges in…

The distributions of the smallest and largest eigenvalues for the matrix product $Z^\dagger Z$, where $Z$ is an $n \times m$ complex Gaussian matrix with correlations both along rows and down columns, are expressed as $m \times m$…

We prove a large deviation result for a random symmetric n x n matrix with independent identically distributed entries to have a few eigenvalues of size n. If the spectrum S survives when the matrix is rescaled by a factor of n, it can only…