June 15, 2015
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 impo...
December 19, 2023
This article is devoted to the study of products of random operators of the form $M_{0,n}=M_0\cdots M_{n-1}$, where $(M_{n})_{n\in\mathbb{N}}$ is an ergodic sequence of positive operators on the space of signed measures on a space $\mathbb{X}$. Under suitable conditions, in particular, a Doeblin-type minoration suited for non conservative operators, we obtain asymptotic results of the form \[ \mu M_{0,n} \simeq \mu(\tilde{h}) r_n \pi_n,\] where $\tilde{h}$ is a random bounded...
August 17, 2012
We study limit distributions of independent random matrices as well as limit joint distributions of their blocks under normalized partial traces composed with classical expectation. In particular, we are concerned with the ensemble of symmetric blocks of independent Hermitian random matrices which are asymptotically free, asymptotically free from diagonal deterministic matrices, and whose norms are uniformly bounded. This class contains symmetric blocks of unitarily invariant...
August 26, 2014
We obtain nonasymptotic bounds on the spectral norm of random matrices with independent entries that improve significantly on earlier results. If $X$ is the $n\times n$ symmetric matrix with $X_{ij}\sim N(0,b_{ij}^2)$, we show that \[\mathbf{E}\Vert X\Vert \lesssim\max_i\sqrt{\sum_jb_{ij}^2}+\max _{ij}\vert b_{ij}\vert \sqrt{\log n}.\] This bound is optimal in the sense that a matching lower bound holds under mild assumptions, and the constants are sufficiently sharp that we ...
August 13, 2021
A central tool in the study of nonhomogeneous random matrices, the noncommutative Khintchine inequality, yields a nonasymptotic bound on the spectral norm of general Gaussian random matrices $X=\sum_i g_i A_i$ where $g_i$ are independent standard Gaussian variables and $A_i$ are matrix coefficients. This bound exhibits a logarithmic dependence on dimension that is sharp when the matrices $A_i$ commute, but often proves to be suboptimal in the presence of noncommutativity. In ...
February 8, 2024
Let $ \nu $ be a probability distribution over the linear semi-group $ \mathrm{End}(E) $ for $ E $ a finite dimensional vector space over a locally compact field. We assume that $ \nu $ is proximal, strongly irreducible and that $ \nu^{*n}\{0\}=0 $ for all integers $ n\in\mathbb{N} $. We consider the random sequence $ \overline\gamma_n := \gamma_0 \cdots \gamma_{n-1} $ for $ (\gamma_k)_{k \ge 0} $ independents of distribution law $ \nu $. We define the logarithmic singular ga...
October 16, 2014
We study approximation properties of sequences of centered random elements $X_d$, $d\in\mathbb N$, with values in separable Hilbert spaces. We focus on sequences of tensor product-type and, in particular, degree-type random elements, which have covariance operators of corresponding tensor form. The average case approximation complexity $n^{X_d}(\varepsilon)$ is defined as the minimal number of continuous linear functionals that is needed to approximate $X_d$ with relative $2$...
March 15, 2017
Inspired by a recent paper of I. Grama, E. Le Page and M. Peign\'e, we consider a sequence $(g_n)_{n \geq 1}$ of i.i.d. random $d\times d$-matrices with non-negative entries and study the fluctuations of the process $(\log \vert g_n\cdots g_1\cdot x\vert )_{n \geq 1}$ for any non-zero vector $x$ in $\mathbb R^d$ with non-negative coordinates. Our method involves approximating this process by a martingale and studying harmonic functions for its restriction to the upper half li...
July 12, 2019
Suppose $\{ X_k \}_{k \in \mathbb{Z}}$ is a sequence of bounded independent random matrices with common dimension $d\times d$ and common expectation $\mathbb{E}[ X_k ]= X$. Under these general assumptions, the normalized random matrix product $$Z_n = (I + \frac{1}{n}X_n)(I + \frac{1}{n}X_{n-1}) \cdots (I + \frac{1}{n}X_1)$$ converges to $Z_n \rightarrow e^{X}$ as $n \rightarrow \infty$. Normalized random matrix products of this form arise naturally in stochastic iterative alg...
May 28, 2020
Let $U^N = (U_1^N,\dots, U^N_p)$ be a d-tuple of $N\times N$ independent Haar unitary 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. In 1998, Voiculescu showed that the empirical measure of the eigenvalues of this polynomial evaluated in Haar unitary matrices and deterministic matrices converges towards a deterministic measure defined thanks to f...