Related papers: Concentration inequalities for random tensors
We give a distribution-dependent concentration inequality for functions of independent variables. The result extends Bernstein's inequality from sums to more general functions, whose variation in any argument does not depend too much on the…
For n>=1 let X_n be a vector of n independent Bernoulli random variables. We assume that X_n consists of M "blocks" such that the Bernoulli random variables in block i have success probability p_i. Here M does not depend on n and the size…
Consider a random sum $\eta_1 v_1 + ... + \eta_n v_n$, where $\eta_1,...,\eta_n$ are i.i.d. random signs and $v_1,...,v_n$ are integers. The Littlewood-Offord problem asks to maximize concentration probabilities such as $\P(\eta_1 v_1 + ...…
In this note we consider the $k$th level of the uniform random recursive tree after $n$ steps, and prove that the proportion of nodes with degree greater than $t\log n$ converges to $(1-t)^k$ almost surely, as $n\to\infty$, for every…
We analyze the extreme value dependence of independent, not necessarily identically distributed multivariate regularly varying random vectors. More specifically, we propose estimators of the spectral measure locally at some time point and…
Random contractions (sub-unitary random matrices) appear naturally when considering quantized chaotic maps within a general theory of open linear stationary systems with discrete time. We analyze statistical properties of complex…
Let $A$ be an $n\times n$ random matrix with independent rows $R_1(A),\dots,R_n(A)$, and assume that for any $i\leq n$ and any three-dimensional linear subspace $F\subset {\mathbb R}^n$ the orthogonal projection of $R_i(A)$ onto $F$ has…
We consider the problem of finding the smallest or largest entry of a tensor of order N that is specified via its rank decomposition. Stated in a different way, we are given N sets of R-dimensional vectors and we wish to select one vector…
We consider $d\times d$ tensors $A(x)$ that are symmetric, positive semi-definite, and whose row-divergence vanishes identically. We establish sharp inequalities for the integral of $(\det A)^{\frac1{d-1}}$. We apply them to models of…
In this note we generalize the results of the recent work by Tom Bohman and Jacob Hofstad on the independence number in G(n, p) to the case of the random k-uniform hypergraph. Concentration in two values occurs in the regime…
A generalization of the Bernstein matrix concentration inequality to random tensors of general order is proposed. This generalization is based on the use of Einstein products between tensors, from which a strong link can be established…
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…
While classical concentration inequalities are typically restricted to two special cases -- independence and martingale difference sequences -- we extend concentration inequalities to a much broader class of stochastic processes by relaxing…
We derive new comparison inequalities between weak and strong moments of norms of random vectors with optimal (up to an universal factor) constants. We discuss applications to the concentration of log-concave random vectors and bounds on…
We study estimation and detection of high-order moment and cumulant tensors from $n$ i.i.d.\ observations of a $p$-dimensional random vector, with performance measured in tensor spectral norm. Under sub-Gaussianity, we show that the minimax…
In the Orthogonal Vectors (OV) problem, we wish to determine if there is an orthogonal pair of vectors among $n$ Boolean vectors in $d$ dimensions. The OV Conjecture (OVC) posits that OV requires $n^{2-o(1)}$ time to solve, for all…
Let $X,X_1,\ldots,X_n$ be independent identically distributed random variables. The paper deals with the question about the behavior of the concentration function of the random variable $\sum\limits_{k=1}^{n}X_k a_k$ according to the…
In this paper, we investigate the problem of classifying feature vectors with mutually independent but non-identically distributed elements. First, we show the importance of this problem. Next, we propose a classifier and derive an…
Let $X_1,\ldots,X_n$ be independent identically distributed random variables. In this paper we study the behavior of concentration functions of weighted sums $\sum_{k=1}^{n}X_ka_k $ with respect to the arithmetic structure of…
Continuing the work of [9] who defined the restrictiveness of stochastic orders and calculated the restrictiveness of the usual stochastic order and the likelihood ratio order, we calculate the restrictiveness of the hazard rate order.…