- Bernstein inequalities (probability theory)
In
probability theory , the Bernstein inequalities are a family of inequalities proved bySergei Bernstein in the 1920-s and 1930-s. In these inequalities, are random variables with zeroexpected value : .
The goal is to show that (under different assumptions) the probabilityis exponentially small.ome of the inequalities
First (1.-3.) suppose that the variables are independent(see [1] , [3] , [4] )
1. Assume that for . Denote . Then
:
for
: .
2. Assume that for . Then
for .
3. If almost surely, then
for any .In [2] , Bernstein proved a generalisation to weakly dependent random variables. For example,2. can be extended in the following way:
4. Suppose ;assume that and
.
ThenProofs
The proofs are based on an application of
Chebyshev's inequality to the random variable , for a suitable choice of the parameter .Related inequalities
The Bernstein inequalities were rediscovered several times in various forms. Thus, a particular case of 1.-3. is known as
Hoeffding's inequality ; see alsoChernoff bound . A weaker form of 4. is known asAzuma's inequality .References
(according to: S.N.Bernstein, Collected Works, Nauka, 1964)
[1] S.N.Bernstein, "On a modification of Chebyshev’s inequality and of the error formula of Laplace",vol. 4, #5 (original publication: Ann. Sci. Inst. Sav. Ukraine, Sect. Math. 1, 1924)
[2] S.N.Bernstein, "On several modifications of Chebyshev's inequality",vol. 4, #22 (original publication: Doklady Akad. Nauk SSSR, 17, n. 6 (1937), 275-277)
[3] S.N.Bernstein, "Theory of Probability" (Russian), Moscow, 1927
[4] J.V.Uspensky, "Introduction to Mathematical Probability", 1937
Wikimedia Foundation. 2010.