Related papers: Matrix Poincar\'e inequalities and concentration

Given a suitably normalized $X\in\mathbb{R}^n$ we observe that the function $\theta\mapsto\mathbb{E}|X\cdot\theta|$, defined for $\theta\in S^{n-1}$, admits surprisingly strong concentration far surpassing what is expected on account of…

We prove concentration results for $\ell_p^n$ operator norms of rectangular random matrices and eigenvalues of self-adjoint random matrices. The random matrices we consider have bounded entries which are independent, up to a possible…

We give an upper bound on the total variation distance between the linear eigenvalue statistic, properly scaled and centred, of a random matrix with a variance profile and the standard Gaussian random variable. The second order Poincar\'e…

We derive concentration inequalities for empirical means $\frac{1}{t} \int_0^t f(X_s) ds$ where $X_s$ is an irreducible Markov jump process on a finite state space and $f$ some observable. Using a Feynman-Kac semigroup we first derive a…

We investigate the complexity of covariance matrix estimation for Gibbs distributions based on dependent samples from a Markov chain. We show that when $\pi$ satisfies a Poincar\'e inequality and the chain possesses a spectral gap, we can…

We extend recent higher order concentration results in the discrete setting to include functions of possibly dependent variables whose distribution (on the product space) satisfies a logarithmic Sobolev inequality with respect to a…

We show that, under mild assumptions, the spectrum of a sum of independent random matrices is close to that of the Gaussian random matrix whose entries have the same mean and covariance. This nonasymptotic universality principle yields…

We derive transport-entropy inequalities for mixed binomial point processes, and for Poisson point processes. We show that when the finite intensity measure satisfies a Talagrand transport inequality, the law of the point process also…

Conditions on the generator of a Markov process to control the fluctuations of its bridges are found. In particular, continuous time random walks on graphs and gradient diffusions are considered. Under these conditions, a concentration of…

Let $V\in C^2(\R^d)$ such that $\mu_V(\d x):= \e^{-V(x)}\,\d x$ is a probability measure, and let $\aa\in (0,2)$. Explicit criteria are presented for the $\aa$-stable-like Dirichlet form $$\E_{\aa,V}(f,f):= \int_{\R^d\times\R^d}…

Linear statistics of eigenvalues in many familiar classes of random matrices are known to obey gaussian central limit theorems. The proofs of such results are usually rather difficult, involving hard computations specific to the model in…

We prove concentration inequalities for several models of non-linear random matrices. As corollaries we obtain estimates for linear spectral statistics of the conjugate kernel of neural networks and non-commutative polynomials in (possibly…

We extend some sharp inequalities for martingale-differences to general multiplicative systems of random variables. The key ingredient in the proofs is a technique reducing the general case to the case of Rademacher random variables without…

We prove a version of Talagrand's concentration inequality for subordinated sub-Laplacian on a compact Riemannian manifold using tools from noncommutative geometry. As an application, motivated by quantum information theory, we show that on…

Weighted Poincar\'e-type and related inequalities provide upper bounds of the variance of functions. Their application in sensitivity analysis allows for quickly identifying the active inputs. Although the efficiency in prioritizing inputs…

In this paper, we study moment and concentration inequalities for the spectral norm of sums of dependent random matrices. We establish novel Rosenthal-Burkholder inequalities for discrete-time matrix local martingales,…

We give a concentration inequality based on the premise that random variables take values within a particular region. The concentration inequality guarantees that, for any sequence of correlated random variables, the difference between the…

We present a non-asymptotic concentration inequality for the random matrix product \begin{equation}\label{eq:Zn} Z_n = \left(I_d-\alpha X_n\right)\left(I_d-\alpha X_{n-1}\right)\cdots \left(I_d-\alpha X_1\right), \end{equation} where…

We study the Multiple-try Metropolis algorithm using the framework of Poincar\'e inequalities. We describe the Multiple-try Metropolis as an auxiliary variable implementation of a resampling approximation to an ideal Metropolis--Hastings…

The aim of this paper is to show that a probability measure concentrates independently of the dimension like a gaussian measure if and only if it verifies Talagrand's $\T_2$ transportation-cost inequality. This theorem permits us to give a…