Related papers: On maximal tail probability of sums of nonnegative…
Chebyshev's inequality provides an upper bound on the tail probability of a random variable based on its mean and variance. While tight, the inequality has been criticized for only being attained by pathological distributions that abuse the…
The authors announce a general tail estimate, called a decoupling inequality, for a symmetrized sum of non-linear $k$-correlations of $n>k$ independent random variables.
We prove tail estimates for variables $\sum_i f(X_i)$, where $(X_i)_i$ is the trajectory of a random walk on an undirected graph (or, equivalently, a reversible Markov chain). The estimates are in terms of the maximum of the function $f$,…
We study the lower tail large deviation problem for subgraph counts in a random graph. Let $X_H$ denote the number of copies of $H$ in an Erd\H{o}s-R\'enyi random graph $\mathcal{G}(n,p)$. We are interested in estimating the lower tail…
We construct a new tail bound for the sum of independent random variables for situations in which the expected value of the sum is known and each random variable lies within a specified interval, which may be different for each variable.…
Let $\{\xi_1,\xi_2,\ldots\}$ be a sequence of independent but not necessarily identically distributed random variables. In this paper, the sufficient conditions are found under which the tail probability…
We establish an upper bound on the tails of a random variable that arises as a solution of a stochastic difference equation. In the non--negative case our bound is similar to a lower bound obtained by Goldie and Gr\"ubel in 1996.
We obtain some optimal inequalities on tail probabilities for sums of independent bounded random variables. Our main result completes an upper bound on tail probabilities due to Talagrand by giving a one-term asymptotic expansion for large…
Let $\{X_1, X_2, ... \}$ be a sequence of dependent heavy-tailed random variables with distributions $F_1, F_2,...$ on $(-\infty,\infty)$, and let $\tau$ be a nonnegative integer-valued random variable independent of the sequence $\{X_k, k…
The well-known "Janson's inequality" gives Poisson-like upper bounds for the lower tail probability \Pr(X \le (1-\eps)\E X) when X is the sum of dependent indicator random variables of a special form. We show that, for large deviations,…
We give explicit bounds for the tail probabilities for sums of independent geometric or exponential variables, possibly with different parameters.
We suggest approximating the distribution of the sum of independent and identically distributed random variables with a Pareto-like tail by combining extreme value approximations for the largest summands with a normal approximation for the…
The approach used by Kalashnikov and Tsitsiashvili for constructing upper bounds for the tail distribution of a geometric sum with subexponential summands is reconsidered. By expressing the problem in a more probabilistic light, several…
We study the upper tail of the number of arithmetic progressions of a given length in a random subset of {1,...,n}, establishing exponential bounds which are best possible up to constant factors in the exponent. The proof also extends to…
The sums and maxima of non-stationary random length sequences of regularly varying random variables may have the same tail and extremal indices, Markovich and Rodionov (2020). The main constraint is that there exists a unique series in a…
Let $X_1,X_2,...$ be a sequence of independent and identically distributed random variables, and put $S_n=X_1+...+X_n$. Under some conditions on the positive sequence $\tau_n$ and the positive increasing sequence $a_n$, we give necessary…
Let S_k be the k-th partial sum of Banach space valued independent identically distributed random variables. In this paper, we compare the tail distribution of ||S_k|| with that of ||S_j||, and deduce some tail distribution maximal…
The non-asymptotic tail bounds of random variables play crucial roles in probability, statistics, and machine learning. Despite much success in developing upper bounds on tail probability in literature, the lower bounds on tail…
We establish upper and lower bounds with matching leading terms for tails of weighted sums of two-sided exponential random variables. This extends Janson's recent results for one-sided exponentials.
The upper tail problem in the Erd\H{o}s--R\'enyi random graph $G\sim\mathcal{G}_{n,p}$ asks to estimate the probability that the number of copies of a graph $H$ in $G$ exceeds its expectation by a factor $1+\delta$. Chatterjee and Dembo…