Sharp Concentration Results for Heavy-Tailed Distributions

03/30/2020
by   Milad Bakhshizadeh, et al.
0

We obtain concentration and large deviation for the sums of independent and identically distributed random variables with heavy-tailed distributions. Our concentration results are concerned with random variables whose distributions satisfy P(X>t) ≤ e^- I(t), where I: R→R is an increasing function and I(t)/t →α∈ [0, ∞) as t →∞. Our main theorem can not only recover some of the existing results, such as the concentration of the sum of subWeibull random variables, but it can also produce new results for the sum of random variables with heavier tails. We show that the concentration inequalities we obtain are sharp enough to offer large deviation results for the sums of independent random variables as well. Our analyses which are based on standard truncation arguments simplify, unify and generalize the existing results on the concentration and large deviation of heavy-tailed random variables.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/30/2020

Concentration Inequalities for Multinoulli Random Variables

We investigate concentration inequalities for Dirichlet and Multinomial ...
research
11/07/2022

Heavy-Tailed Loss Frequencies from Mixtures of Negative Binomial and Poisson Counts

Heavy-tailed random variables have been used in insurance research to mo...
research
11/23/2022

On the links between Stein transforms and concentration inequalities for dependent random variables

In this paper, we explore some links between transforms derived by Stein...
research
09/18/2022

Convergence Rate of Sample Mean for φ-Mixing Random Variables with Heavy-Tailed Distributions

This article studies the convergence rate of the sample mean for φ-mixin...
research
05/03/2019

A Constructive Proof of a Concentration Bound for Real-Valued Random Variables

Almost 10 years ago, Impagliazzo and Kabanets (2010) gave a new combinat...
research
09/06/2021

Bounding Means of Discrete Distributions

We introduce methods to bound the mean of a discrete distribution (or fi...
research
02/06/2018

A large deviation approach to super-critical bootstrap percolation on the random graph G_n,p

We consider the Erdös--Rényi random graph G_n,p and we analyze the simpl...

Please sign up or login with your details

Forgot password? Click here to reset