Related papers: Large deviation inequalities for sums of indicator…

We provide finite sample upper and lower bounds on the Binomial tail probability which are a direct application of Sanov's theorem. We then use these to obtain high probability upper and lower bounds on the minimum of i.i.d. Binomial random…

Measures of tail dependence between random variables aim to numerically quantify the degree of association between their extreme realizations. Existing tail dependence coefficients (TDCs) are based on an asymptotic analysis of relevant…

Let $S$ and $X$ be independent random variables, assuming values in the set of non-negative integers, and suppose further that both $\mathbb{E}(S)$ and $\mathbb{E}(X)$ are integers satisfying $\mathbb{E}(S)\ge \mathbb{E}(X)$. We establish a…

The upper bound inequality for variance of weighted sum of correlated random variables is derived according to Cauchy-Schwarz's inequality, while the weights are non-negative with sum of 1. We also give a novel proof with positive…

The task for a general and useful classification of the tail behaviors of probability distributions still has no satisfactory solution. Due to lack of information outside the range of the data the tails of the distribution should be…

We show an extension of Sanov's theorem on large deviations, controlling the tail probabilities of i.i.d. random variables with matching concentration and anti-concentration bounds. This result has a general scope, applies to samples of any…

In this paper, we study the fluctuations of sums of random variables with distribution defined as a mixture of light-tail and truncated heavy-tail distributions. We focus on the case when both the mixing coefficient and the truncation level…

We derive upper bounds on the tail conditional expectation of binomial and Poisson random variables. Those upper bounds are subsequently employed to the problem of obtaining non-asymptotic lower bounds on the probability that the…

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…

An infinite convergent sum of independent and identically distributed random variables discounted by a multiplicative random walk is called perpetuity, because of a possible actuarial application. We give three disjoint groups of sufficient…

Sums of independent, bounded random variables concentrate around their expectation approximately as well a Gaussian of the same variance. Well known results of this form include the Bernstein, Hoeffding, and Chernoff inequalities and many…

It is known that large deviations of sums of subexponential random variables are most likely realised by deviations of a single random variable. In this article we give a detailed picture of how subexponential random variables are…

We consider heavy-tailed distributions and compare the well-known estimators of the tail index, based on extreme value theory with a comparatively recent estimator based on a different idea.

Olkin and Shepp (2005, J. Statist. Plann. Inference, vol. 130, pp. 351--358) presented a matrix form of Chernoff's inequality for Normal and Gamma (univariate) distributions. We extend and generalize this result, proving Poincare-type and…

We revisit and refine known tail inequalities and confidence bounds for the hypergeometric distribution, i.e., for the setting where we sample without replacement from a fixed population with binary values or properties. The results are…

Let $\{X_t, t \geq 1\}$ be a sequence of identically distributed and pairwise asymptotically independent random variables with regularly varying tails and $\{ \Theta_t, t\geq1 \}$ be a sequence of positive random variables independent of…

We study probability inequalities leading to tail estimates in a general semigroup $\mathscr{G}$ with a translation-invariant metric $d_{\mathscr{G}}$. (An important and central example of this in the functional analysis literature is that…

We present an analytical technique to compute the probability of rare events in which the largest eigenvalue of a random matrix is atypically large (i.e.\ the right tail of its large deviations). The results also transfer to the left tail…

Starting with the large deviation principle (LDP) for the Erd\H{o}s-R\'enyi binomial random graph $\mathcal{G}(n,p)$ (edge indicators are i.i.d.), due to Chatterjee and Varadhan (2011), we derive the LDP for the uniform random graph…

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…