Related papers: Tail Bounds on the Spectral Norm of Sub-Exponentia…
Consider an nxn random matrix X with i.i.d. nonnegative entries with bounded density, mean m, and finite positive variance sigma^2. Let M be the nxn random Markov matrix with i.i.d. rows obtained from X by dividing each row of X by its sum.…
Let $M_n= \fsu X1n$ be a sum of independent random variables such that $ X_k\leq 1$, $\E X_k =0$ and $\E X_k^2=\s_k^2$ for all $k$. Hoeffding 1963, Theorem 3, proved that $$\P{M_n \geq nt}\leq H^n(t,p),\quad H(t,p)= \bgl(1+qt/p\bgr)^{p +qt}…
In this paper we consider the problem of estimating the joint upper and lower tail large deviations of the edge eigenvalues of an Erd\H{o}s-R\'enyi random graph $\mathcal{G}_{n,p}$, in the regime of $p$ where the edge of the spectrum is no…
The scaled standard Wigner matrix (symmetric with mean zero, variance one i.i.d. entries), and its limiting eigenvalue distribution, namely the semi-circular distribution, has attracted much attention. The $2k$th moment of the limit equals…
We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…
In this paper we provide explicit upper bounds on some distances between the (law of the) output of a random Gaussian NN and (the law of) a random Gaussian vector. Our results concern both shallow random Gaussian neural networks with…
We discuss the limiting spectral density of real symmetric random matrices. Other than in standard random matrix theory the upper diagonal entries are not assumed to be independent, but we will fill them with the entries of a stochastic…
In this paper, we prove exponential tail bounds for canonical (or degenerate) $U$-statistics and $U$-processes under exponential-type tail assumptions on the kernels. Most of the existing results in the relevant literature often assume…
Let $\pa{X_{t}}_{t\in T}$ be a family of real-valued centered random variables indexed by a countable set $T$. In the first part of this paper, we establish exponential bounds for the deviation probabilities of the supremum $Z=\sup_{t\in…
We prove deviation inequalities for sums of high-dimensional random matrices and operators with dependence and {\rc heavy tails}. Estimation of high-dimensional matrices is a concern for numerous modern applications. However, most results…
Tensor models play an increasingly prominent role in many fields, notably in machine learning. In several applications, such as community detection, topic modeling and Gaussian mixture learning, one must estimate a low-rank signal from a…
We study generalisations of a simple, combinatorial proof of a Chernoff bound similar to the one by Impagliazzo and Kabanets (RANDOM, 2010). In particular, we prove a randomized version of the hitting property of expander random walks and…
We realize many sharp spectral bounds of the spectral radius of a nonnegative square matrix $C$ by using the largest real eigenvalues of suitable matrices of smaller sizes related to $C$ that are very easy to find. As applications, we give…
We study the largest eigenvalue of a Gaussian random symmetric matrix $X_n$, with zero-mean, unit variance entries satisfying the condition $\sup_{(i, j) \ne (i', j')}|\mathbb{E}[X_{ij} X_{i'j'}]| = O(n^{-(1 + \varepsilon)})$, where…
We extend the theory of concentration inequalities to simple random tensors with heavy-tailed coefficients. Specifically, we consider the class of sub-Weibull distributions $\mathcal{S}_\alpha$ for $\alpha \in [1, 2]$. We establish…
We consider the least singular value of a large random matrix with real or complex i.i.d. Gaussian entries shifted by a constant $z\in\mathbb{C}$. We prove an optimal lower tail estimate on this singular value in the critical regime where…
We derive exponential bounds for tail of distribution for natural, i.e. under ordinary logarithm, normalized sums of arrays of random variables, not necessarily independent.
The largest eigenvalue of random tensors is an important feature of systems involving disorder, equivalent to the ground state energy of glassy systems or to the injective norm of quantum states. For symmetric Gaussian random tensors of…
In contrast to the neatly bounded spectra of densely populated large random matrices, sparse random matrices often exhibit unbounded eigenvalue tails on the real and imaginary axis, called Lifshitz tails. In the case of asymmetric matrices,…
We establish sharp tail asymptotics for component-wise extreme values of bivariate Gaussian random vectors with arbitrary correlation between the components. We consider two scaling regimes for the tail event in which we demonstrate the…