Related papers: User-friendly tail bounds for sums of random matri…
We investigate the properties of a discrete-time martingale $\{X_m\}_{m\in \mathbb Z_{\geq 0}}$, where all differences between adjacent random variables are limited to be not more than a constant as a promise. In this situation, it is known…
We reconsider a classical, well-studied problem from applied probability. This is the max-sum equivalence of randomly weighted sums, and the originality is because we manage to include interdependence among the primary random variables, as…
This is Part II of our work about random tensor inequalities and tail bounds for bivariate random tensor means. After reviewing basic facts about random tensors, we first consider tail bounds with more general connection functions. Then, a…
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…
We derive the tail inequalities between two random variables starting from inequalities between its moment, or more generally between its Lebesgue-Riesz norms, which holds true on certain sets of parameters. We consider some applications…
Freedman's inequality is a martingale counterpart to Bernstein's inequality. This result shows that the large-deviation behavior of a martingale is controlled by the predictable quadratic variation and a uniform upper bound for the…
We derive upper bounds for probabilities of the form $P(g(\mathbf{X})\geq t)$ using the southwest boundary (recently introduced in our previous work) $\partial_{\mathrm{SW}} Q(g^{-1}[t,\infty))$, where $Q$ is a reflection to the first…
We establish new tail estimates for order statistics and for the Euclidean norms of projections of an isotropic log-concave random vector. More generally, we prove tail estimates for the norms of projections of sums of independent…
We consider the problem of deriving upper bounds on the parameters of sum-rank-metric codes, with focus on their dimension and block length. The sum-rank metric is a combination of the Hamming and the rank metric, and most of the available…
The approach of Kleitman (1970) and Kanter (1976) to multivariate concentration function inequalities is generalized in order to obtain for deviation probabilities of sums of independent symmetric random variables a lower bound depending…
In this paper we revisited the classical problem of max-sum equivalence of randomly weighted sums in two dimensions. In opposite to the most papers in literature, we consider that there exists some interdependence between the primary random…
In this paper we obtain a Bernstein type inequality for the sum of self-adjoint centered and geometrically absolutely regular random matrices with bounded largest eigenvalue. This inequality can be viewed as an extension to the matrix…
The Bernstein inequality is a tight upper bound on tail probabilities for independent random variables. Freedman extended the Bernstein inequality to martingales with differences bounded from above, and then Dzhaparidze and van Zanten…
This work derives extremal tail bounds for the Gaussian trace estimator applied to a real symmetric matrix. We define a partial ordering on the eigenvalues, so that when a matrix has greater spectrum under this ordering, its estimator will…
A random vector $X$ with representation $X=\sum_{j\geq0}A_jZ_j$ is considered. Here, $(Z_j)$ is a sequence of independent and identically distributed random vectors and $(A_j)$ is a sequence of random matrices, `predictable' with respect to…
Let $X$ be an $n\times n$ symmetric random matrix with independent but non-identically distributed entries. The deviation inequalities of the spectral norm of $X$ with Gaussian entries have been obtained by using the standard concentration…
The current work applies some recent combinatorial tools due to Jain to control the eigenvalue gaps of a matrix $M_n = M + N_n$ where $M$ is deterministic, symmetric with large operator norm and $N_n$ is a random symmetric matrix with…
This paper presents compact notations for concentration inequalities and convenient results to streamline probabilistic analysis. The new expressions describe the typical sizes and tails of random variables, allowing for simple operations…
We consider a multivariate distributional recursion of sum-type as arising in the probabilistic analysis of algorithms and random trees. We prove an upper tail bound for the solution using Chernoff's bounding technique by estimating the…
Random matrices have played an important role in many fields including machine learning, quantum information theory and optimization. One of the main research focuses is on the deviation inequalities for eigenvalues of random matrices.…