相关论文: A Reversion of the Chernoff Bound
Consider $n$ real/complex, independent/dependent random variables with respective tail bounds and $g$ a measurable function of the r.v.'s. Consider $f$ the "sharpest" tail bound of $g$ (sharpest in the sense that if $f$ were any less, then…
It is argued that there is a need for fat-tailed distributions that become thin in the extreme tail. A 3-parameter distribution is introduced that visually resembles the t-distribution and interpolates between the normal distribution and…
New upper bounds on the relative entropy are derived as a function of the total variation distance. One bound refines an inequality by Verd\'{u} for general probability measures. A second bound improves the tightness of an inequality by…
We establish Hoeffding-type concentration inequalities for the low and high tail bounds of sums of exchangeable random variables. Our results exhibit an anti-symmetry in such tail bounds due to the assumption of exchangeability, a…
In this paper, we obtain optimal uniform lower tail estimates for the probability distribution of the properly scaled length of the longest up/right path of the last passage site percolation model considered by Johansson in [12]. The…
Correcting for skewness can result in more accurate tail probability approximations in the central limit theorem for sums of independent random variables. In this paper, we extend the theory to sums of local statistics of independent random…
Let F be a distribution function with negative mean and regularly varying right tail. Under a mild smoothness condition we derive higher order asymptotic expansions for the tail distribution of the maxima of the random walk generated by F.…
In many areas of interest, modern risk assessment requires estimation of the extremal behaviour of sums of random variables. We derive the first order upper-tail behaviour of the weighted sum of bivariate random variables under weak…
In this paper, we study estimates on tail probabilities $\mathbb{P}(S_r \ge t)$ of several classes of subordinators under mild assumptions on the tail of its L\'evy measure. As an application of that result, we obtain two-sided estimates…
Multivariate regular variation plays a role assessing tail risk in diverse applications such as finance, telecommunications, insurance and environmental science. The classical theory, being based on an asymptotic model, sometimes leads to…
We generalize a famous tail Doob's inequality, relative two non-negative random variables, arising in the martingale theory, in two directions: on the more general source data and on the random variables belonging to the so-called Grand…
In several applications, ultimately at the largest data, truncation effects can be observed when analysing tail characteristics of statistical distributions. In some cases truncation effects are forecasted through physical models such as…
In a general class of one dimensional random differential equation the convergence of the distribution function of the solution to stationary state distribution is studied. In particular it is proved the boundedness respectively the…
The possibilities of the use of the coefficient of variation over a high threshold in tail modelling are discussed. The paper also considers multiple threshold tests for a generalized Pareto distribution, together with a threshold selection…
A survey is given of some Chernoff type bounds for the tail probabilities P(X-EX > a) and P(X-EX < a) when X is a random variable that can be written as a sum of indicator variables that are either independent or negatively related. Most…
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 describe a general reduction technique for analyzing learning algorithms that are subject to light-tailed (but not necessarily bounded) randomness, a scenario that is often the focus of theoretical analysis. We show that the analysis of…
Many management decisions involve accumulated random realizations for which only the first and second moments of their distribution are available. The sharp Chebyshev-type bound for the tail probability and Scarf bound for the expected loss…
Learning the tail behavior of a distribution is a notoriously difficult problem. By definition, the number of samples from the tail is small, and deep generative models, such as normalizing flows, tend to concentrate on learning the body of…
General upper tail estimates are given for counting edges in a random induced subhypergraph of a fixed hypergraph H, with an easy proof by estimating the moments. As an application we consider the numbers of arithmetic progressions and…