| word looked up : | home / archive |
Central limit theoremCentral limit theorems are a set of weak-convergence results in probability theory. Intuitively, they all express the fact that any sum of many independent identically distributed random variables is approximately normally distributed. These results explain the ubiquity of the normal distribution. The most important and famous result is simply called The Central Limit Theorem; it is concerned with independent variables with identical distribution whose expected value and variance are finite. Several generalizations exist which do not require identical distribution but incorporate some condition which guarantees that none of the variables exert a much larger influence than the others. Two such conditions are the Lindeberg condition and the Lyapunov condition. Other generalizations even allow some "weak" dependence of the random variables.
| |||
Let X1,X2,X3,... be a sequence of random variables which are defined on the same probability space, share the same probability distribution D and are independent. Assume that both the expected value μ and the standard deviation σ of D exist and are finite.
Consider the sum :Sn=X1+...+Xn. Then the expected value of Sn is nμ and its standard deviation is σ n½. Furthermore, informally speaking, the distribution of Sn approaches the normal distribution N(nμ,σ2n) as n approaches ∞.
In order to clarify the word "approaches" in the last sentence, we normalize Sn by setting
Then the distribution of Zn converges towards the standard normal distribution N(0,1) as n approaches ∞. This means: if Φ(z) is the cumulative distribution function of N(0,1), then for every real number z, we have
If the third central moment E((X1-μ)3) exists and is finite, then the above convergence is uniform and the speed of convergence is at least on the order of 1/n½ (see Berry-Esséen theorem[?]).
An equivalent formulation of this limit theorem starts with An = (X1 + ... + Xn) / n which can be interpreted as the mean of a random sample of size n. The expected value of An is μ and the standard deviation is σ / n½. If we normalize An by setting Zn = (An - μ) / (σ / n½), we obtain the same variable Zn as above, and it approaches a standard normal distribution.
Note the following "paradox": by adding many independent identically distributed positive variables, one gets approximately a normal distribution. But for every normally distributed variable, the probability that it is negative is non-zero! How is it possible to get negative numbers from adding only positives? The key lies in the word "approximately". The sum of positive variables is of course always positive, but it is very well approximated by a normal variable (which indeed has a very tiny probability of being negative).
More precisely: the fact that, in this case, for every n there is a z such that Pr(Zn ≤ z) = 0 doesn't contradict that for every z we have limn→∞ Pr(Zn ≤ z) > 0, because in the first case z may depend on n and in the second case n is increased for a fixed z.
Let Xn be a sequence of independent random variables defined on the same probability space. Assume that Xn has finite expected value μn and finite standard deviation σn. We define
Assume that the third central moments
are finite for every n, and that
(This is the Lyapunov condition.) We again consider the sum Sn=X1+...+Xn. The expected value of Sn is mn = ∑i=1..nμi and its standard deviation is sn. If we normalize Sn by setting
then the distribution of Zn converges towards the standard normal distribution N(0,1) as above.
In the same setting and with the same notation as above, we can replace the Lyapunov condition with the following weaker one: for every ε > 0
\lim_{n \to \infty} \sum_{i = 1}^{n} \mbox{E}\left(
\frac{(X_i - \mu_i)^2}{s_n^2}
:
\left| X_i - \mu_i \right| > \epsilon s_n
\right) = 0
</math>
(where E( U : V > c) denotes the conditional expected value: the expected value of U given that V > c.) Then the distribution of the normalized sum Zn converges towards the standard normal distribution N(0,1).
There are some theorems which treat the case of sums of non-independent variables, for instance the m-dependent central limit theorem, the martingale central limit theorem and the central limit theorem for mixing processes.
Schultern und kletterte den re/rest.html">Rest der Böschung hoch.
Wir hatten es geschafft, wenigstens soweit. Ich nahm ihr den Gürtel
baumeln. Dabei kam dass Wasser aus ihren Lungen. sie.html">sie.html">sie.html">sie.html">sie.html">sie.html">sie.html">sie.html">sie.html">sie.html">Sie hatte viel
Langsam--einen Atemzug nach dem andern. Ich lauschte. Nichts. Ich blies
hoffnungsvolle noch deprimierte. Ich tat einfach, was ich tun musste.
da/dann.html">Dann fing sie an leicht zu atmen. Erst ganz sanft. Ein Weilchen atmete
waren immer noch geschlossen. die.html">die.html">die.html">die.html">die.html">Die Atemzüge waren kurz, zuckend. Doch
meine Hüfte schmerzte. Sara sah nicht einmal so schlecht aus. Sie hatte
gebrochen zu sein. Sie blutete ein Bisschen von ihren Händen, die
Füssen, die bluteten. Es war.html">war.html">war.html">war.html">war aber nicht schlimm.
Ich hatte mich auf einen Stein gesetzt und hielt Sara in meinen Armen.
ihre Schultern wieder und wieder. Sie fing an zu schlottern. Und da
lange an. Ich hoffte sie hatte keinen Gehirnschaden erlitten. Konnte sie
Dann legte ich die Jacke um Sara und knöpfte sie zu. Vielleicht würde
anzuziehen. Doch ich brauchte ihre Hilfe und sie schien noch immer nicht
Da hielt ich sie, meine kleine Sara. Wie glücklich ich war, dass sie am
schloss die Augen. Sie schlief ein. Ihr Herz klopfte immer noch hart.
nicht allzu schwer, denn es war schön, sie zu halten.
Sie schlief ein Weilchen und öffnete die Augen wieder und schaute mich
sie einen Fremden an. Sie wusste ja nicht, wer ich war. Sie schien
vorwurfsvoll an. Sie schien auch nicht zu wissen, was passiert war. Sie
mich und verbarg ihr Gesicht in meinen Armen. So hielt ich sie ein
meinen Hals und klammerte sich an mich, als wäre ich ein Felsen im
.
On
wordlookup.net
All is still licensed under the GNU FDL.
It uses material from the wikipedia.
|
|