Vysochanskij–Petunin inequality

In probability theory, the Vysochanskij–Petunin inequality gives a lower bound for the probability that a random variable with finite variance lies within a certain number of standard deviations of the variable's mean, or equivalently an upper bound for the probability that it lies further away. The sole restrictions on the distribution are that it be unimodal and have finite variance; here unimodal implies that it is a continuous probability distribution except at the mode, which may have a non-zero probability.

Theorem

edit

Let   be a random variable with unimodal distribution, and  . If we define   then for any  ,

 

Relation to Gauss's inequality

edit

Taking   equal to a mode of   yields the first case of Gauss's inequality.

Tightness of Bound

edit

Without loss of generality, assume   and  .

  • If  , the left-hand side can equal one, so the bound is useless.
  • If  , the bound is tight when   with probability   and is otherwise distributed uniformly in the interval  .
  • If  , the bound is tight when   with probability   and is otherwise distributed uniformly in the interval  .

Specialization to mean and variance

edit

If   has mean   and finite, non-zero variance  , then taking   and   gives that for any  

 

Proof Sketch

edit

For a relatively elementary proof see.[1] The rough idea behind the proof is that there are two cases: one where the mode of   is close to   compared to  , in which case we can show  , and one where the mode of   is far from   compared to  , in which case we can show  . Combining these two cases gives   When  , the two cases give the same value.

Properties

edit

The theorem refines Chebyshev's inequality by including the factor of 4/9, made possible by the condition that the distribution be unimodal.

It is common, in the construction of control charts and other statistical heuristics, to set λ = 3, corresponding to an upper probability bound of 4/81= 0.04938..., and to construct 3-sigma limits to bound nearly all (i.e. 95%) of the values of a process output. Without unimodality Chebyshev's inequality would give a looser bound of 1/9 = 0.11111....

One-sided version

edit

An improved version of the Vysochanskij-Petunin inequality for one-sided tail bounds exists. For a unimodal random variable   with mean   and variance  , and  , the one-sided Vysochanskij-Petunin inequality[2] holds as follows:

 

The one-sided Vysochanskij-Petunin inequality, as well as the related Cantelli inequality, can for instance be relevant in the financial area, in the sense of "how bad can losses get."

Proof

edit

The proof is very similar to that of Cantelli's inequality. For any  ,

 

Then we can apply the Vysochanskij-Petunin inequality. With  , we have:

 

As in the proof of Cantelli's inequality, it can be shown that the minimum of   over all   is achieved at  . Plugging in this value of   and simplifying yields the desired inequality.

Generalisation

edit

Dharmadhikari and Joag-Dev generalised the VP inequality to deviations from an arbitrary point and moments of order   other than  

 

where

 

The standard form of the inequality can be recovered by setting   which leads to a unique value of  .[3]

See also

edit

References

edit
  1. ^ Pukelsheim, F., 1994. The Three Sigma Rule. The American Statistician, 48(2), pp.88-91
  2. ^ Mercadier, Mathieu; Strobel, Frank (2021-11-16). "A one-sided Vysochanskii-Petunin inequality with financial applications" (PDF). European Journal of Operational Research. 295 (1): 374–377. doi:10.1016/j.ejor.2021.02.041. ISSN 0377-2217.
  3. ^ Dharmadhikari, S. W.; Joag-Dev, K. (1986). "The Gauss–Tchebyshev inequality for unimodal distributions". Theory of Probability & Its Applications. 30 (4): 867–871. doi:10.1137/1130111.
  NODES
Idea 1
idea 1
Note 1