Bernstein inequalities (probability theory)

Bernstein inequalities (probability theory)

In probability theory, the Bernstein inequalities are a family of inequalities proved by Sergei Bernstein in the 1920-s and 1930-s. In these inequalities, X_1, X_2, X_3, dots, X_n are random variables with zero expected value: mathbf{E} X_i = 0.
The goal is to show that (under different assumptions) the probability mathbf{P} left{ sum_{j=1}^n X_j > t ight} is exponentially small.

ome of the inequalities

First (1.-3.) suppose that the variables X_j are independent(see [1] , [3] , [4] )

1. Assume that |mathbf{E} X_j^k| leq frac{k!}{4!} left(frac{L}{5} ight)^{k-4}for k = 4, 5, 6, dots. Denote A_k = sum mathbf{E} X_j^k . Then

: mathbf{P} left{ |sum_{j=1}^n X_j - frac{A_3 t^2}{3A_2}| geq sqrt{2A_2} , t left [ 1 + frac{A_4 t^2}{6 A_2^2} ight] ight} < 2 exp left{ - t^2 ight}

for

: 0 < t leq frac{5 sqrt{2A_2{4L} .


2. Assume that |mathbf{E} X_j^k| leq frac{mathbf{E} X_j^2}{2} L^{k-2} k!for k geq 2 . Then
mathbf{P} left{ sum_{j=1}^n X_j geq 2 t sqrt{sum mathbf{E} X_j^2} ight} < exp left{ - t^2 ight} for 0 < t leq frac{sqrt{sum X_j^2{2L} .


3. If |X_j| leq M almost surely, then
mathbf{P} left{ sum_{j=1}^n X_j > t ight} leq exp left{ - frac{t^2/2}{sum mathbf{E} X_j^2 + Mt/3 } ight} for any t > 0 .


In [2] , Bernstein proved a generalisation to weakly dependent random variables. For example,2. can be extended in the following way:

4. Suppose mathbf{E} left{ X_{j+1} | X_1, dots, X_j ight} = 0 ;assume that mathbf{E} left{ X_j^2 | X_1, dots, X_{j-1} ight} leq R_j mathbf{E} X_j^2 and
mathbf{E} left{ X_j^k | X_1, dots, X_{j-1} ight} leq frac{mathbf{E} left{ X_j^2 | X_1, dots, X_{j-1} ight{2} L^{k-2} k! .

Then mathbf{P} left{ sum_{j=1}^n X_j geq 2 t sqrt{sum_{j=1}^n R_j mathbf{E} X_j^2} ight} < exp(-t^2) quad ext{for} quad 0 < t leq frac{sqrt{sum_{j=1}^n R_j mathbf{E} X_j^2{2L}.

Proofs

The proofs are based on an application of Chebyshev's inequality to the random variable exp left{ lambda sum_{j=1}^n X_j ight} , for a suitable choice of the parameter lambda > 0 .

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 also Chernoff bound. A weaker form of 4. is known as Azuma'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.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Bernstein inequality — In mathematics, Bernstein inequality may refer to:* Bernstein s inequality (mathematical analysis) * Bernstein inequalities (probability theory)disambig …   Wikipedia

  • List of inequalities — This page lists Wikipedia articles about named mathematical inequalities. Inequalities in pure mathematics =Analysis= * Askey–Gasper inequality * Bernoulli s inequality * Bernstein s inequality (mathematical analysis) * Bessel s inequality *… …   Wikipedia

  • Sergei Natanovich Bernstein — Infobox Scientist name = Sergei Natanovich Bernstein image width = 300px caption = Sergei Natanovich Bernstein birth date = birth date|1880|3|5|df=y birth place = Odessa, Imperial Russia death date = death date and age|1968|10|26|1880|3|5|df=y… …   Wikipedia

  • Chernoff bound — In probability theory, the Chernoff bound, named after Herman Chernoff, gives exponentially decreasing bounds on tail distributions of sums of independent random variables. It is better than the first or second moment based tail bounds such as… …   Wikipedia

  • List of mathematics articles (B) — NOTOC B B spline B* algebra B* search algorithm B,C,K,W system BA model Ba space Babuška Lax Milgram theorem Baby Monster group Baby step giant step Babylonian mathematics Babylonian numerals Bach tensor Bach s algorithm Bachmann–Howard ordinal… …   Wikipedia

  • Markov's inequality — gives an upper bound for the measure of the set (indicated in red) where f(x) exceeds a given level . The bound combines the level with the average value of f …   Wikipedia

  • Doob martingale — A Doob martingale (also known as a Levy martingale) is a mathematical construction of a stochastic process which approximates a given random variable and has the martingale property with respect to the given filtration. It may be thought of as… …   Wikipedia

  • Concentration inequality — In mathematics, concentration inequalities provide probability bounds on how a random variable deviates from some value (e.g. its expectation). The laws of large numbers of classical probability theory state that sums of independent random… …   Wikipedia

  • List of Russian people — The Millennium of Russia monument in Veliky Novgorod, featuring the statues and reliefs of the most celebrated people in the first 1000 years of Russian history …   Wikipedia

  • List of Russian mathematicians — Andrey Kolmogorov, a preeminent 20th century mathematician. This list of Russian mathematicians includes the famous mathematicians from the Russian Empire, the Soviet Union and the Russian Federation. This list is incomplete; you can help by …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”