Suppose that $X_1,\...,X_n,\...$ are i.i.d. rotationally invariant $N$-by-$N$ matrices. Let $Π_n=X_n\... X_1$. It is known that $n^{-1}\log |Π_n|$ converges to a nonrandom limit. We prove that under certain additional assumptions on matrices $X_i$ the speed of convergence to this limit does not decrease when the size of matrices, $N$, grows.
Let $(ξ_j)_{j\ge1} $, be a non-stationary Markov chain with phase space $X$ and let $\mathfrak{g}_j:\,X\mapsto\mathrm{SL}(m,\mathbb{R})$ be a sequence of functions on $X$ with values in the unimodular group. Set $g_j=\mathfrak{g}_j(ξ_j)$ and denote by $S_n=g_n\ldots g_1$, the product of the matrices $g_j$. We provide sufficient conditions for exponential growth of the norm $\|S_n\|$ when the Markov chain is not supposed to be stationary. This generalizes the classical theorem of Furstenberg on the exponential growth of products of independent identically distributed matrices as well as its ext…
In this short note we address a gaussian property of normal vectors in random non-Hermitian matrices. The approach uses a simple geometric and comparison technique.
We prove estimates for the expected value of operator norms of Gaussian random matrices with independent and mean-zero entries, acting as operators from $\ell^m_{p^*}$ to $\ell_q^n$, $1\leq p^* \leq 2 \leq q \leq \infty$.
We discuss regularization by noise of the spectrum of large random non-Normal matrices. Under suitable conditions, we show that the regularization of a sequence of matrices that converges in *-moments to a regular element $a$, by the addition of a polynomially vanishing Gaussian Ginibre matrix, forces the empirical measure of eigenvalues to converge to the Brown measure of $a$.
We investigate the spectral norms of symmetric $N \times N$ matrices from two pseudo-random ensembles. The first is the pseudo-Wigner ensemble introduced in "Pseudo-Wigner Matrices" by Soloveychik, Xiang and Tarokh and the second is its sample covariance-type analog defined in this work. Both ensembles are defined through the concept of $r$-independence by controlling the amount of randomness in the underlying matrices, and can be constructed from dual BCH codes. We show that when the measure of randomness $r$ grows as $N^ρ$, where $ρ\in (0,1]$ and $\varepsilon > 0$, the norm of the matrices i…
This paper investigates an upper bound of the operator norm for sub-Gaussian tailed random matrices. A lot of attention has been put on uniformly bounded sub-Gaussian tailed random matrices with independent coefficients. However, little has been done for sub-Gaussian tailed random matrices whose matrix coefficients variance are not equal or for matrix for which coefficients are not independent. This is precisely the subject of this paper. After proving that random matrices with uniform sub-Gaussian tailed independent coefficients satisfy the Tracy Widom bound, that is, their matrix operator no…
We give a non-asymptotic bound on the spectral norm of a $d\times d$ matrix $X$ with centered jointly Gaussian entries in terms of the covariance matrix of the entries. In some cases, this estimate is sharp and removes the $\sqrt{\log d}$ factor in the noncommutative Khintchine inequality.
In this work, we consider symmetric random Toeplitz matrices $T_n$ generated by i.i.d. zero mean random variables ${X_k}$ satisfying the moment conditions: $E|X_k|^2=1$ and $\E|X_1|^n \le n^{\sqrt{n}}$ for all $n\ge 3$. We prove that the largest eigenvalue of $T_n$ scaled by $\sqrt{n log(n)}$ converges almost surely to $1$.
Let X_N= (X_1^(N), ..., X_p^(N)) be a family of N-by-N independent, normalized random matrices from the Gaussian Unitary Ensemble. We state sufficient conditions on matrices Y_N =(Y_1^(N), ..., Y_q^(N)), possibly random but independent of X_N, for which the operator norm of P(X_N, Y_N, Y_N^*) converges almost surely for all polynomials P. Limits are described by operator norms of objects from free probability theory. Taking advantage of the choice of the matrices Y_N and of the polynomials P we get for a large class of matrices the "no eigenvalues outside a neighborhood of the limiting spectru…
In this paper, we investigate the following question: How often is a random matrix normal? We consider a random $n\times n$ matrix, $M_n$, whose entries are i.i.d. Rademacher random variables (taking values $\{ \pm1 \}$ with probability $1/2$) and prove $$2^{-\left(0.5+o(1)\right)n^2} \le P\left(M_n \text{ is normal}\right) \le 2^{-(0.302+o(1))n^{2}}. $$ We conjecture that the lower bound is sharp.
We introduce the notion of a random matrix-valued multiplicative function, generalizing Rademacher random multiplicative functions to matrices. We provide an asymptotic for the second moment based on a linear recurrence property for Hilbert-Schmidt norms of sucessive products of random matrices. Moreover, we provide upper bounds for the higher even moments related to the generalized joint spectral radius.
We give simple criteria to identify the exponential order of magnitude of the absolute value of the determinant for wide classes of random matrix models, not requiring the assumption of invariance. These include Gaussian matrices with covariance profiles, Wigner matrices and covariance matrices with subexponential tails, Erdős-Rényi and $d$-regular graphs for any polynomial sparsity parameter, and non-mean-field random matrix models, such as random band matrices for any polynomial bandwidth. The proof builds on recent tools, including the theory of the Matrix Dyson Equation as developed in [Aj…
We introduce a family of norms on the $n \times n$ complex matrices. These norms arise from a probabilistic framework, and their construction and validation involve probability theory, partition combinatorics, and trace polynomials in noncommuting variables. As a consequence, we obtain a generalization of Hunter's positivity theorem for the complete homogeneous symmetric polynomials.
In contemporary applied and computational mathematics, a frequent challenge is to bound the expectation of the spectral norm of a sum of independent random matrices. This quantity is controlled by the norm of the expected square of the random matrix and the expectation of the maximum squared norm achieved by one of the summands; there is also a weak dependence on the dimension of the random matrix. The purpose of this paper is to give a complete, elementary proof of this important, but underappreciated, inequality.
In the last decade there has been increasing interest in the fields of random matrices, interacting particle systems, stochastic growth models, and the connections between these areas. For instance, several objects appearing in the limit of large matrices arise also in the long time limit for interacting particles and growth models. Examples of these are the famous Tracy-Widom distribution functions and the Airy_2 process. The link is however sometimes fragile. For example, the connection between the eigenvalues in the Gaussian Orthogonal Ensembles (GOE) and growth on a flat substrate is restr…
We study random normal matrix models whose eigenvalues tend to be distributed within a narrow "band" around the unit circle of width proportional to $\frac1n$, where $n$ is the size of matrices. For general radially symmetric potentials with various boundary conditions, we derive the scaling limits of the correlation functions, some of which appear in the previous literature notably in the context of almost-Hermitian random matrices. We also obtain that fluctuations of the maximal and minimal modulus of the ensembles follow the Gumbel or exponential law depending on the boundary conditions.
We establish a connection between the $L^2$ norm of sums of dilated functions whose $j$th Fourier coefficients are $\mathcal{O}(j^{-α})$ for some $α\in (1/2,1)$, and the spectral norms of certain greatest common divisor (GCD) matrices. Utilizing recent bounds for these spectral norms, we obtain sharp conditions for the convergence in $L^2$ and for the almost everywhere convergence of series of dilated functions.
In this contribution we consider stochastic growth models in the Kardar-Parisi-Zhang universality class in 1+1 dimension. We discuss the large time distribution and processes and their dependence on the class on initial condition. This means that the scaling exponents do not uniquely determine the large time surface statistics, but one has to further divide into subclasses. Some of the fluctuation laws were first discovered in random matrix models. Moreover, the limit process for curved limit shape turned out to show up in a dynamical version of hermitian random matrices, but this analogy does…
The link between a particular class of growth processes and random matrices was established in the now famous 1999 article of Baik, Deift, and Johansson on the length of the longest increasing subsequence of a random permutation. During the past ten years, this connection has been worked out in detail and led to an improved understanding of the large scale properties of one-dimensional growth models. The reader will find a commented list of references at the end. Our objective is to provide an introduction highlighting random matrices. From the outset it should be emphasized that this connecti…