ID: math/0611593

The norm of products of free random variables

November 20, 2006

View on ArXiv
Vladislav Kargin
Mathematics
Probability
Operator Algebras

Let $X_i$ denote free identically-distributed random variables. This paper investigates how the norm of products $\Pi_n=X_1 X_2 ... X_n$ behaves as $n$ approaches infinity. In addition, for positive $X_i$ it studies the asymptotic behavior of the norm of $Y_n=X_1 \circ X_2 \circ ...\circ X_n$, where $\circ$ denotes the symmetric product of two positive operators: $A \circ B=:A^{1/2}BA^{1/2}$. It is proved that if the expectation of $X_i$ is 1, then the norm of the symmetric product $Y_{n}$ is between $c_1 n^{1/2}$ and $c_2 n$ for certain constant $c_1$ and $c_2$. That is, the growth in the norm is at most linear. For the norm of the usual product $Pi_n$, it is proved that the limit of $n^{-1}\log Norm(Pi_n)$ exists and equals $\log \sqrt{E(X_i^{\ast}X_{i})}.$ In other words, the growth in the norm of the product is exponential and the rate equals the logarithm of the Hilbert-Schmidt norm of operator X. Finally, if $\pi $ is a cyclic representation of the algebra generated by $X_i$, and if $\xi$ is a cyclic vector, then $n^{-1}\log Norm(\pi (\Pi_{n}) \xi)=\log \sqrt{E(X_{i}^{\ast}X_{i})}$ for all $n.$ In other words, the growth in the length of the cyclic vector is exponential and the rate coincides with the rate in the growth of the norm of the product. These results are significantly different from analogous results for commuting random variables and generalize results for random matrices derived by Kesten and Furstenberg.

Similar papers 1

Products of random matrices: Dimension and growth in norm

March 3, 2009

90% Match
Vladislav Kargin
Probability

Suppose that $X_1,\...,X_n,\...$ are i.i.d. rotationally invariant $N$-by-$N$ matrices. Let $\Pi_n=X_n\... X_1$. It is known that $n^{-1}\log |\Pi_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.

Find SimilarView on arXiv

Operator $\ell^\infty \to \ell^\infty$ norm of products of random matrices

February 10, 2025

88% Match
Jean-Christophe Mourrat
Probability

We study the $\ell^\infty \to \ell^\infty$ operator norm of products of independent random matrices with independent and identically distributed entries. For $n$-by-$n$ matrices whose entries are centered, have unit variance, and have a finite moment of order $4\alpha$ for some $\alpha > 1$, we find that the operator norm of the product of $p$ matrices behaves asymptotically like $n^{\frac {p+1}{2}}\sqrt{2/\pi}$. The case of products of possibly non-square matrices with possi...

Find SimilarView on arXiv

The norm of polynomials in large random and deterministic matrices

April 23, 2010

87% Match
C. Male
Probability
Operator Algebras

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

Find SimilarView on arXiv

Eigenvalue Distributions of Sums and Products of Large Random Matrices via Incremental Matrix Expansions

November 15, 2005

86% Match
Matthew J. M. Peacock, Iain B. Collings, Michael L. Honig
Information Theory
Information Theory

This paper uses an incremental matrix expansion approach to derive asymptotic eigenvalue distributions (a.e.d.'s) of sums and products of large random matrices. We show that the result can be derived directly as a consequence of two common assumptions, and matches the results obtained from using R- and S-transforms in free probability theory. We also give a direct derivation of the a.e.d. of the sum of certain random matrices which are not free. This is used to determine the ...

Find SimilarView on arXiv

Norms of structured random matrices

December 29, 2021

86% Match
Radosław Adamczak, Joscha Prochno, ... , Strzelecki Michał
Probability
Functional Analysis

For $m,n\in\mathbb{N}$ let $X=(X_{ij})_{i\leq m,j\leq n}$ be a random matrix, $A=(a_{ij})_{i\leq m,j\leq n}$ a real deterministic matrix, and $X_A=(a_{ij}X_{ij})_{i\leq m,j\leq n}$ the corresponding structured random matrix. We study the expected operator norm of $X_A$ considered as a random operator between $\ell_p^n$ and $\ell_q^m$ for $1\leq p,q \leq \infty$. We prove optimal bounds up to logarithmic terms when the underlying random matrix $X$ has i.i.d. Gaussian entries, ...

Find SimilarView on arXiv

Products of Independent Non-Hermitian Random Matrices

December 20, 2010

85% Match
Sean O'Rourke, Alexander Soshnikov
Probability
Mathematical Physics

For fixed $m>1$, we consider $m$ independent $n \times n$ non-Hermitian random matrices $X_1, ..., X_m$ with i.i.d. centered entries with a finite $(2+\eta)$-th moment, $ \eta>0.$ As $n$ tends to infinity, we show that the empirical spectral distribution of $n^{-m/2} \*X_1 X_2 ... X_m$ converges, with probability 1, to a non-random, rotationally invariant distribution with compact support in the complex plane. The limiting distribution is the $m$-th power of the circular law.

Find SimilarView on arXiv

On the operator norm of non-commutative polynomials in deterministic matrices and iid GUE matrices

December 10, 2019

85% Match
Benoît Collins, Alice Guionnet, Félix Parraud
Probability
Operator Algebras

Let $X^N = (X_1^N,\dots, X^N_d)$ be a d-tuple of $N\times N$ independent GUE random matrices and $Z^{NM}$ be any family of deterministic matrices in $\mathbb{M}_N(\mathbb{C})\otimes \mathbb{M}_M(\mathbb{C})$. Let $P$ be a self-adjoint non-commutative polynomial. A seminal work of Voiculescu shows that the empirical measure of the eigenvalues of $P(X^N)$ converges towards a deterministic measure defined thanks to free probability theory. Let now $f$ be a smooth function, the m...

Find SimilarView on arXiv

Limit theorems for iid products of positive matrices

January 5, 2023

85% Match
C LMBA Cuny, J MAP5 - UMR 8145 Dedecker, F LAMA Merlevède
Probability

We study stochastic properties of the norm cocycle associated with iid products of positive matrices. We obtain the almost sure invariance principle (ASIP) with rate o(n 1/p) under the optimal condition of a moment or order p > 2 and the Berry-Esseen theorem with rate O(1/ $\sqrt$ n) under the optimal condition of a moment of order 3. The results are also valid for the matrix norm. For the matrix coefficients, we also have the ASIP but we obtain only partial results for the B...

Find SimilarView on arXiv

Asymptotic Freeness of Unitary Matrices in Tensor Product Spaces for Invariant States

November 18, 2019

85% Match
Benoît Collins, Pierre Yves Gaudreau Lamarre, Camille Male
Probability
Combinatorics
Operator Algebras

In this paper, we pursue our study of asymptotic properties of families of random matrices that have a tensor structure. In previous work, the first- and second-named authors provided conditions under which tensor products of unitary random matrices are asymptotically free with respect to the normalized trace. Here, we extend this result by proving that asymptotic freeness of tensor products of Haar unitary matrices holds with respect to a significantly larger class of states...

Find SimilarView on arXiv

On the Asymptotic Spectrum of Products of Independent Random Matrices

December 13, 2010

85% Match
Friedrich Götze, Alexander Tikhomirov
Probability

We consider products of independent random matrices with independent entries. The limit distribution of the expected empirical distribution of eigenvalues of such products is computed. Let $X^{(\nu)}_{jk},{}1\le j,r\le n$, $\nu=1,...,m$ be mutually independent complex random variables with $\E X^{(\nu)}_{jk}=0$ and $\E {|X^{(\nu)}_{jk}|}^2=1$. Let $\mathbf X^{(\nu)}$ denote an $n\times n$ matrix with entries $[\mathbf X^{(\nu)}]_{jk}=\frac1{\sqrt{n}}X^{(\nu)}_{jk}$, for $1\le...

Find SimilarView on arXiv