Related papers: Hoeffding's inequality for sums of weakly dependen…

The main purpose of this paper is to obtain strong laws of large numbers for arrays or weighted sums of random variables under a scenario of dependence. Namely, for triangular arrays $\{X_{n,k}, \, 1 \leqslant k \leqslant n, \, n \geqslant…

We present some extensions of Bernstein's concentration inequality for random matrices. This inequality has become a useful and powerful tool for many problems in statistics, signal processing and theoretical computer science. The main…

We discuss estimating the probability that the sum of nonnegative independent and identically distributed random variables falls below a given threshold, i.e., $\mathbb{P}(\sum_{i=1}^{N}{X_i} \leq \gamma)$, via importance sampling (IS). We…

We derive tight and computable bounds on the bias of statistical estimators, or more generally of quantities of interest, when evaluated on a baseline model P rather than on the typically unknown true model Q. Our proposed method combines…

Performing an additive decomposition of arbitrary functions of random elements is paramount for global sensitivity analysis and, therefore, the interpretation of black-box models. The well-known seminal work of Hoeffding characterized the…

Let $X_1,..., X_N\in\R^n$ be independent centered random vectors with log-concave distribution and with the identity as covariance matrix. We show that with overwhelming probability at least $1 - 3 \exp(-c\sqrt{n}\r)$ one has $ \sup_{x\in…

We study an unbiased estimator for the density of a sum of random variables that are simulated from a computer model. A numerical study on examples with copula dependence is conducted where the proposed estimator performs favourably in…

While useful probability bounds for $n$ pairwise independent Bernoulli random variables adding up to at least an integer $k$ have been proposed in the literature, none of these bounds are tight in general. In this paper, we provide several…

Given $X$ a random vector in ${\mathbb{R}}^n$, set $X_1,...,X_N$ to be independent copies of $X$ and let $\Gamma=\frac{1}{\sqrt{N}}\sum_{i=1}^N <X_i,\cdot>e_i$ be the matrix whose rows are $\frac{X_1}{\sqrt{N}},\dots, \frac{X_N}{\sqrt{N}}$.…

In this paper an analytic expression is given for the bounds of the distribution function of the sum of dependent normally distributed random variables. Using the theory of copulas and the important Frechet bounds the dependence structure…

The theory of dependency graphs is a powerful toolbox to prove asymptotic normality of sums of random variables. In this article, we introduce a more general notion of weighted dependency graphs and give normality criteria in this context.…

We give a shorter proof of Kanter's (1976) sharp Bessel function bound for concentrations of sums of independent symmetric random vectors. We provide sharp upper bounds for the sum of modified Bessel functions $I_0(x)+I_1(x)$, which might…

We study extremal statistics and return intervals in stationary long-range correlated sequences for which the underlying probability density function is bounded and uniform. The extremal statistics we consider e.g., maximum relative to…

In this article we present a Bernstein inequality for sums of random variables which are defined on a graphical network whose nodes grow at an exponential rate. The inequality can be used to derive concentration inequalities in…

This work is devoted to explore fundamental aspects of the spectral properties of few-body general operators. We first consider the following question: when we know the probability distributions of a set of observables, what can we way on…

This paper develops Kolmogorov-type maximal inequalities for sums of Negative Binomial random variables under both independence and dependence structures. For independent heterogeneous Negative Binomial variables we derive sharp Markov-type…

Let $X$ be a random variable with distribution function $F,$ and $X_{1},X_{2},...,X_{n}$ are independent copies of $X.$ Consider the order statistics $X_{i:n},$ $i=1,2,...,n$ and denote $F_{i:n}(x)=P\{X_{i:n}\leq x\}.$ Using majorization…

It is shown that at least 50% of the probability mass of a sum of independent Rademacher random variables is within one standard deviation from its mean. This lower bound is sharp, it is much better than for instance the bound that can be…

Fix a graph $H$ and some $p\in (0,1)$, and let $X_H$ be the number of copies of $H$ in a random graph $G(n,p)$. Random variables of this form have been intensively studied since the foundational work of Erd\H{o}s and R\'{e}nyi. There has…

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…