Central limit theorem explained

Central Limit Theorem
Field:	Probability theory
Type:	Theorem
Statement:	The scaled sum of a sequence of i.i.d. random variables with finite positive variance converges in distribution to the normal distribution.
Generalizations:	Lindeberg's CLT

In probability theory, the central limit theorem (CLT) states that, under appropriate conditions, the distribution of a normalized version of the sample mean converges to a standard normal distribution. This holds even if the original variables themselves are not normally distributed. There are several versions of the CLT, each applying in the context of different conditions.

The theorem is a key concept in probability theory because it implies that probabilistic and statistical methods that work for normal distributions can be applicable to many problems involving other types of distributions.

This theorem has seen many changes during the formal development of probability theory. Previous versions of the theorem date back to 1811, but in its modern form it was only precisely stated as late as 1920.

In statistics, the CLT can be stated as: let

X _{1,} X _{2,} ... , X _{n} denote a statistical sample of size n from a population with expected value (average) \mu and finite positive variance \sigma ^{2} , and let \bar{X _{n}} denote the sample mean (which is itself a random variable). Then the limit as n\to inf ty of the distribution of ((\bar{X)/(^{n - \mu)}{ (\sigma)/(\sqrt{n)}) }}, is a normal distribution with mean 0 and variance 1 .^[1]

In other words, suppose that a large sample of observations is obtained, each observation being randomly produced in a way that does not depend on the values of the other observations, and that the average (arithmetic mean) of the observed values is computed. If this procedure is performed many times, resulting in a collection of observed averages, the central limit theorem says that if the sample size was large enough, the probability distribution of these averages will closely approximate a normal distribution.

The central limit theorem has several variants. In its common form, the random variables must be independent and identically distributed (i.i.d.). This requirement can be weakened; convergence of the mean to the normal distribution also occurs for non-identical distributions or for non-independent observations if they comply with certain conditions.

The earliest version of this theorem, that the normal distribution may be used as an approximation to the binomial distribution, is the de Moivre–Laplace theorem.

Independent sequences

Classical CLT

Let

\{X _{1,} \ldots, X _{n}\} be a sequence of i.i.d. random variables having a distribution with expected value given by \mu and finite variance given by \sigma ^{2.} Suppose we are interested in the sample average$$\backslash bar\_n\; \backslash equiv\; \backslash frac.$$

By the law of large numbers, the sample average converges almost surely (and therefore also converges in probability) to the expected value

\mu as n\to inf ty.

The classical central limit theorem describes the size and the distributional form of the stochastic fluctuations around the deterministic number

\mu during this convergence. More precisely, it states that as n gets larger, the distribution of the difference between the sample average \bar{X} _{n} and its limit \mu, when multiplied by the factor \sqrt{n} — that is, \sqrt{n}(\bar{X} _{n} - \mu) — approaches the normal distribution with mean 0 and variance \sigma ^{2.} For large enough n, the distribution of \bar{X} _{n} gets arbitrarily close to the normal distribution with mean \mu and variance \sigma ^{2/n.}

The usefulness of the theorem is that the distribution of

\sqrt{n}(\bar{X} _{n} - \mu) approaches normality regardless of the shape of the distribution of the individual X _{i.} Formally, the theorem can be stated as follows:

In the case

\sigma > 0 , convergence in distribution means that the cumulative distribution functions of \sqrt{n}(\bar{X} _{n} - \mu) converge pointwise to the cdf of the l{N}(0, \sigma ^{2)} distribution: for every real number z, $$\backslash lim\_\; \backslash mathbb\backslash left[\backslash sqrt\{n\}(\backslash bar\{X\}\_n-\backslash mu)\; \backslash le\; z\backslash right]\; =\; \backslash lim\_\; \backslash mathbb\backslash left[\backslash frac\{\backslash sqrt\{n\}(\backslash bar\{X\}\_n-\backslash mu)\}\{\backslash sigma\; \}\; \backslash le\; \backslash frac\{z\}\{\backslash sigma\}\backslash right]=\; \backslash Phi\backslash left(\backslash frac\backslash right),$$where \Phi(z) is the standard normal cdf evaluated at z. The convergence is uniform in z in the sense that$$\backslash lim\_\backslash ;\backslash sup\_\backslash ;\backslash left|\backslash mathbb\backslash left[\backslash sqrt\{n\}(\backslash bar\{X\}\_n-\backslash mu)\; \backslash le\; z\backslash right]\; -\; \backslash Phi\backslash left(\backslash frac\backslash right)\backslash right|\; =\; 0~,$$where \sup denotes the least upper bound (or supremum) of the set.

Lyapunov CLT

In this variant of the central limit theorem the random variables $X\_i$ have to be independent, but not necessarily identically distributed. The theorem also requires that random variables $\backslash left|\; X\_i\backslash right|$ have moments of some order and that the rate of growth of these moments is limited by the Lyapunov condition given below.

In practice it is usually easiest to check Lyapunov's condition for

If a sequence of random variables satisfies Lyapunov's condition, then it also satisfies Lindeberg's condition. The converse implication, however, does not hold.

Lindeberg CLT

See main article: Lindeberg's condition.

In the same setting and with the same notation as above, the Lyapunov condition can be replaced with the following weaker one (from Lindeberg in 1920).

Suppose that for every $\backslash varepsilon\; >\; 0$$$\backslash lim\_\; \backslash frac\backslash sum\_^\; \backslash operatorname\; E\backslash left[(X\_i\; -\; \backslash mu\_i)^2\; \backslash cdot\; \backslash mathbf\{1\}\_\{\backslash left\backslash \{\backslash left|\; X\_i\; -\; \backslash mu\_i\; \backslash right|\; >\; \backslash varepsilon\; s\_n\; \backslash right\backslash \}\}\; \backslash right]\; =\; 0$$where $\backslash mathbf\_$ is the indicator function. Then the distribution of the standardized sums$$\backslash frac\backslash sum\_^n\; \backslash left(X\_i\; -\; \backslash mu\_i\; \backslash right)$$converges towards the standard normal distribution

Multidimensional CLT

Proofs that use characteristic functions can be extended to cases where each individual $\backslash mathbf\_i$ is a random vector in with mean vector $\backslash boldsymbol\backslash mu\; =\; \backslash operatorname\; E[\backslash mathbf\{X\}\_i]$ and covariance matrix $\backslash mathbf$ (among the components of the vector), and these random vectors are independent and identically distributed. The multidimensional central limit theorem states that when scaled, sums converge to a multivariate normal distribution.^[2] Summation of these vectors is done component-wise.

For

i = 1 , 2 , 3 , \ldots, let$$\backslash mathbf\_i\; =\; \backslash begin\; X\_^\; \backslash \backslash \; \backslash vdots\; \backslash \backslash \; X\_^\; \backslash end$$be independent random vectors. The sum of the random vectors X _{1,} \ldots, X _{n} is$$\backslash sum\_^\; \backslash mathbf\_i\; =\; \backslash begin\; X\_^\; \backslash \backslash \; \backslash vdots\; \backslash \backslash \; X\_^\; \backslash end\; +\; \backslash begin\; X\_^\; \backslash \backslash \; \backslash vdots\; \backslash \backslash \; X\_^\; \backslash end\; +\; \backslash cdots\; +\; \backslash begin\; X\_^\; \backslash \backslash \; \backslash vdots\; \backslash \backslash \; X\_^\; \backslash end\; =\; \backslash begin\; \backslash sum\_^\; X\_^\; \backslash \backslash \; \backslash vdots\; \backslash \backslash \; \backslash sum\_^\; X\_^\; \backslash end$$and their average is$$\backslash mathbf\; =\; \backslash begin\; \backslash bar\; X\_^\; \backslash \backslash \; \backslash vdots\; \backslash \backslash \; \backslash bar\; X\_^\; \backslash end\; =\; \backslash frac\; \backslash sum\_^\; \backslash mathbf\_i.$$Therefore,$$\backslash frac\; \backslash sum\_^\; \backslash left[\backslash mathbf\{X\}\_i\; -\; \backslash operatorname\; E\; \backslash left(\backslash mathbf\{X\}\_i\; \backslash right)\; \backslash right]\; =\; \backslash frac\backslash sum\_^\; (\backslash mathbf\_i\; -\; \backslash boldsymbol\backslash mu)\; =\; \backslash sqrt\backslash left(\backslash overline\_n\; -\; \backslash boldsymbol\backslash mu\backslash right).$$\boldsymbol{\Sigma} is equal to

The multivariate central limit theorem can be proved using the Cramér–Wold theorem.^[2]

The rate of convergence is given by the following Berry–Esseen type result:

It is unknown whether the factor $d^$ is necessary.^[3]

The Generalized Central Limit Theorem

The Generalized Central Limit Theorem (GCLT) was an effort of multiple mathematicians (Bernstein, Lindeberg, Lévy, Feller, Kolmogorov, and others) over the period from 1920 to 1937.^[4] The first published complete proof of the GCLT was in 1937 by Paul Lévy in French.^[5] An English language version of the complete proof of the GCLT is available in the translation of Gnedenko and Kolmogorov's 1954 book.^[6]

The statement of the GCLT is as follows:^[7]

A non-degenerate random variable Z is α-stable for some 0 < α ≤ 2 if and only if there is an independent, identically distributed sequence of random variables X₁, X₂, X₃, ... and constants a_n > 0, b_n ∈ ℝ with

a_n (X₁ + ... + X_n) − b_n → Z.

Here → means the sequence of random variable sums converges in distribution; i.e., the corresponding distributions satisfy F_n(y) → F(y) at all continuity points of F.

In other words, if sums of independent, identically distributed random variables converge in distribution to some Z, then Z must be a stable distribution.

Dependent processes

CLT under weak dependence

A useful generalization of a sequence of independent, identically distributed random variables is a mixing random process in discrete time; "mixing" means, roughly, that random variables temporally far apart from one another are nearly independent. Several kinds of mixing are used in ergodic theory and probability theory. See especially strong mixing (also called α-mixing) defined by $\backslash alpha(n)\; \backslash to\; 0$ where $\backslash alpha(n)$ is so-called strong mixing coefficient.

A simplified formulation of the central limit theorem under strong mixing is:

In fact,$$\backslash sigma^2\; =\; \backslash operatorname\; E\backslash left(X\_1^2\backslash right)\; +\; 2\; \backslash sum\_^\; \backslash operatorname\; E\backslash left(X\_1\; X\_\backslash right),$$where the series converges absolutely.

The assumption $\backslash sigma\; \backslash ne\; 0$ cannot be omitted, since the asymptotic normality fails for $X\_n\; =\; Y\_n\; -\; Y\_$ where $Y\_n$ are another stationary sequence.

There is a stronger version of the theorem: the assumption is replaced with and the assumption $\backslash alpha\_n\; =\; O\backslash left(n^\backslash right)$ is replaced with

Existence of such $\backslash delta\; >\; 0$ ensures the conclusion. For encyclopedic treatment of limit theorems under mixing conditions see .

Martingale difference CLT

See main article: Martingale central limit theorem.

Remarks

Proof of classical CLT

The central limit theorem has a proof using characteristic functions.^[8] It is similar to the proof of the (weak) law of large numbers.

Assume $\backslash$ are independent and identically distributed random variables, each with mean $\backslash mu$ and finite variance The sum $X\_1\; +\; \backslash cdots\; +\; X\_n$ has mean $n\backslash mu$ and variance Consider the random variable$$Z\_n\; =\; \backslash frac\; =\; \backslash sum\_^n\; \backslash frac\; =\; \backslash sum\_^n\; \backslash frac\; Y\_i,$$where in the last step we defined the new random variables each with zero mean and unit variance The characteristic function of $Z\_n$ is given by$$\backslash varphi\_\backslash !(t)\; =\; \backslash varphi\_\backslash !(t)\; \backslash \; =\backslash \; \backslash varphi\_\backslash !\backslash !\backslash left(\backslash frac\backslash right)\; \backslash varphi\_\backslash !\backslash !\; \backslash left(\backslash frac\backslash right)\backslash cdots\; \backslash varphi\_\backslash !\backslash !\; \backslash left(\backslash frac\backslash right)\; \backslash \; =\backslash \; \backslash left[\backslash varphi\_\{Y\_1\}\backslash !\backslash !\backslash left(\backslash frac\{t\}\{\backslash sqrt\{n\}\}\backslash right)\backslash right]^n,$$where in the last step we used the fact that all of the $Y\_i$ are identically distributed. The characteristic function of $Y\_1$ is, by Taylor's theorem,$$\backslash varphi\_\backslash !\backslash left(\backslash frac\backslash right)\; =\; 1\; -\; \backslash frac\; +\; o\backslash !\backslash left(\backslash frac\backslash right),\; \backslash quad\; \backslash left(\backslash frac\backslash right)\; \backslash to\; 0$$where $o(t^2\; /\; n)$ is "little notation" for some function of $t$ that goes to zero more rapidly than By the limit of the exponential function the characteristic function of

Z _{n} equals$$\backslash varphi\_(t)\; =\; \backslash left(1\; -\; \backslash frac\; +\; o\backslash left(\backslash frac\backslash right)\; \backslash right)^n\; \backslash rightarrow\; e^,\; \backslash quad\; n\; \backslash to\; \backslash infty.$$

All of the higher order terms vanish in the limit The right hand side equals the characteristic function of a standard normal distribution $\backslash mathcal(0,\; 1)$, which implies through Lévy's continuity theorem that the distribution of $Z\_n$ will approach $\backslash mathcal(0,1)$ as Therefore, the sample average$$\backslash bar\_n\; =\; \backslash frac$$is such that $$\backslash frac(\backslash bar\_n\; -\; \backslash mu)\; =\; Z\_n$$converges to the normal distribution from which the central limit theorem follows.

Convergence to the limit

The central limit theorem gives only an asymptotic distribution. As an approximation for a finite number of observations, it provides a reasonable approximation only when close to the peak of the normal distribution; it requires a very large number of observations to stretch into the tails.

The convergence in the central limit theorem is uniform because the limiting cumulative distribution function is continuous. If the third central moment $\backslash operatorname\backslash left[(X\_1\; -\; \backslash mu)^3\backslash right]$ exists and is finite, then the speed of convergence is at least on the order of $1\; /\; \backslash sqrt$ (see Berry–Esseen theorem). Stein's method^[9] can be used not only to prove the central limit theorem, but also to provide bounds on the rates of convergence for selected metrics.^[10]

The convergence to the normal distribution is monotonic, in the sense that the entropy of $Z\_n$ increases monotonically to that of the normal distribution.

The central limit theorem applies in particular to sums of independent and identically distributed discrete random variables. A sum of discrete random variables is still a discrete random variable, so that we are confronted with a sequence of discrete random variables whose cumulative probability distribution function converges towards a cumulative probability distribution function corresponding to a continuous variable (namely that of the normal distribution). This means that if we build a histogram of the realizations of the sum of independent identical discrete variables, the piecewise-linear curve that joins the centers of the upper faces of the rectangles forming the histogram converges toward a Gaussian curve as approaches infinity; this relation is known as de Moivre–Laplace theorem. The binomial distribution article details such an application of the central limit theorem in the simple case of a discrete variable taking only two possible values.

Common misconceptions

Studies have shown that the central limit theorem is subject to several common but serious misconceptions, some of which appear in widely used textbooks.^{[11] [12] [13]} These include:

• The misconceived belief that the theorem applies to random sampling of any variable, rather than to the mean values (or sums) of iid random variables extracted from a population by repeated sampling. That is, the theorem assumes the random sampling produces a sampling distribution formed from different values of means (or sums) of such random variables.
• The misconceived belief that the theorem ensures that random sampling leads to the emergence of a normal distribution for sufficiently large samples of any random variable, regardless of the population distribution. In reality, such sampling asymptotically reproduces the properties of the population, an intuitive result underpinned by the Glivenko-Cantelli theorem.
• The misconceived belief that the theorem leads to a good approximation of a normal distribution for sample sizes greater than around 30,^[14] allowing reliable inferences regardless of the nature of the population. In reality, this empirical rule of thumb has no valid justification, and can lead to seriously flawed inferences. See Z-test for where the approximation holds.

Relation to the law of large numbers

The law of large numbers as well as the central limit theorem are partial solutions to a general problem: "What is the limiting behavior of as approaches infinity?" In mathematical analysis, asymptotic series are one of the most popular tools employed to approach such questions.

Suppose we have an asymptotic expansion of $f(n)$:$$f(n)=\; a\_1\; \backslash varphi\_(n)+a\_2\; \backslash varphi\_(n)+O\backslash big(\backslash varphi\_(n)\backslash big)\; \backslash qquad\; (n\; \backslash to\; \backslash infty).$$

Dividing both parts by and taking the limit will produce, the coefficient of the highest-order term in the expansion, which represents the rate at which changes in its leading term.$$\backslash lim\_\; \backslash frac\; =\; a\_1.$$

Informally, one can say: " grows approximately as ". Taking the difference between and its approximation and then dividing by the next term in the expansion, we arrive at a more refined statement about :$$\backslash lim\_\; \backslash frac\; =\; a\_2\; .$$

Here one can say that the difference between the function and its approximation grows approximately as . The idea is that dividing the function by appropriate normalizing functions, and looking at the limiting behavior of the result, can tell us much about the limiting behavior of the original function itself.

Informally, something along these lines happens when the sum,, of independent identically distributed random variables,, is studied in classical probability theory. If each has finite mean, then by the law of large numbers, .^[15] If in addition each has finite variance, then by the central limit theorem,$$\backslash frac\; \backslash to\; \backslash xi,$$where is distributed as . This provides values of the first two constants in the informal expansion$$S\_n\; \backslash approx\; \backslash mu\; n+\backslash xi\; \backslash sqrt.$$

In the case where the do not have finite mean or variance, convergence of the shifted and rescaled sum can also occur with different centering and scaling factors:$$\backslash frac\; \backslash rightarrow\; \backslash Xi,$$or informally$$S\_n\; \backslash approx\; a\_n+\backslash Xi\; b\_n.$$

Distributions which can arise in this way are called stable.^[16] Clearly, the normal distribution is stable, but there are also other stable distributions, such as the Cauchy distribution, for which the mean or variance are not defined. The scaling factor may be proportional to, for any ; it may also be multiplied by a slowly varying function of .^{[17] [18]}

The law of the iterated logarithm specifies what is happening "in between" the law of large numbers and the central limit theorem. Specifically it says that the normalizing function, intermediate in size between of the law of large numbers and of the central limit theorem, provides a non-trivial limiting behavior.

Alternative statements of the theorem

Density functions

The density of the sum of two or more independent variables is the convolution of their densities (if these densities exist). Thus the central limit theorem can be interpreted as a statement about the properties of density functions under convolution: the convolution of a number of density functions tends to the normal density as the number of density functions increases without bound. These theorems require stronger hypotheses than the forms of the central limit theorem given above. Theorems of this type are often called local limit theorems. See Petrov^[19] for a particular local limit theorem for sums of independent and identically distributed random variables.

Characteristic functions

Since the characteristic function of a convolution is the product of the characteristic functions of the densities involved, the central limit theorem has yet another restatement: the product of the characteristic functions of a number of density functions becomes close to the characteristic function of the normal density as the number of density functions increases without bound, under the conditions stated above. Specifically, an appropriate scaling factor needs to be applied to the argument of the characteristic function.

An equivalent statement can be made about Fourier transforms, since the characteristic function is essentially a Fourier transform.

Calculating the variance

Let be the sum of random variables. Many central limit theorems provide conditions such that converges in distribution to (the normal distribution with mean 0, variance 1) as . In some cases, it is possible to find a constant and function such that converges in distribution to as .

Extensions

Products of positive random variables

The logarithm of a product is simply the sum of the logarithms of the factors. Therefore, when the logarithm of a product of random variables that take only positive values approaches a normal distribution, the product itself approaches a log-normal distribution. Many physical quantities (especially mass or length, which are a matter of scale and cannot be negative) are the products of different random factors, so they follow a log-normal distribution. This multiplicative version of the central limit theorem is sometimes called Gibrat's law.

Whereas the central limit theorem for sums of random variables requires the condition of finite variance, the corresponding theorem for products requires the corresponding condition that the density function be square-integrable.

Beyond the classical framework

Asymptotic normality, that is, convergence to the normal distribution after appropriate shift and rescaling, is a phenomenon much more general than the classical framework treated above, namely, sums of independent random variables (or vectors). New frameworks are revealed from time to time; no single unifying framework is available for now.

Convex body

These two -close distributions have densities (in fact, log-concave densities), thus, the total variance distance between them is the integral of the absolute value of the difference between the densities. Convergence in total variation is stronger than weak convergence.

An important example of a log-concave density is a function constant inside a given convex body and vanishing outside; it corresponds to the uniform distribution on the convex body, which explains the term "central limit theorem for convex bodies".

Another example: where and . If then factorizes into which means are independent. In general, however, they are dependent.

The condition ensures that are of zero mean and uncorrelated; still, they need not be independent, nor even pairwise independent. By the way, pairwise independence cannot replace independence in the classical central limit theorem.

Here is a Berry–Esseen type result.

The distribution of need not be approximately normal (in fact, it can be uniform). However, the distribution of is close to $\backslash mathcal(0,\; 1)$ (in the total variation distance) for most vectors according to the uniform distribution on the sphere .

Gaussian polytopes

The same also holds in all dimensions greater than 2.

The polytope is called a Gaussian random polytope.

A similar result holds for the number of vertices (of the Gaussian polytope), the number of edges, and in fact, faces of all dimensions.

Linear functions of orthogonal matrices

A linear function of a matrix is a linear combination of its elements (with given coefficients), where is the matrix of the coefficients; see Trace (linear algebra)#Inner product.

A random orthogonal matrix is said to be distributed uniformly, if its distribution is the normalized Haar measure on the orthogonal group ; see Rotation matrix#Uniform random rotation matrices.

Random walk on a crystal lattice

The central limit theorem may be established for the simple random walk on a crystal lattice (an infinite-fold abelian covering graph over a finite graph), and is used for design of crystal structures.^{[20] [21]}

Applications and examples

A simple example of the central limit theorem is rolling many identical, unbiased dice. The distribution of the sum (or average) of the rolled numbers will be well approximated by a normal distribution. Since real-world quantities are often the balanced sum of many unobserved random events, the central limit theorem also provides a partial explanation for the prevalence of the normal probability distribution. It also justifies the approximation of large-sample statistics to the normal distribution in controlled experiments.

Regression

Regression analysis, and in particular ordinary least squares, specifies that a dependent variable depends according to some function upon one or more independent variables, with an additive error term. Various types of statistical inference on the regression assume that the error term is normally distributed. This assumption can be justified by assuming that the error term is actually the sum of many independent error terms; even if the individual error terms are not normally distributed, by the central limit theorem their sum can be well approximated by a normal distribution.

Other illustrations

See main article: Illustration of the central limit theorem. Given its importance to statistics, a number of papers and computer packages are available that demonstrate the convergence involved in the central limit theorem.^[22]

History

Dutch mathematician Henk Tijms writes:

Sir Francis Galton described the Central Limit Theorem in this way:^[23]

The actual term "central limit theorem" (in German: "zentraler Grenzwertsatz") was first used by George Pólya in 1920 in the title of a paper.^[24] Pólya referred to the theorem as "central" due to its importance in probability theory. According to Le Cam, the French school of probability interprets the word central in the sense that "it describes the behaviour of the centre of the distribution as opposed to its tails". The abstract of the paper On the central limit theorem of calculus of probability and the problem of moments by Pólya^[24] in 1920 translates as follows.

A thorough account of the theorem's history, detailing Laplace's foundational work, as well as Cauchy's, Bessel's and Poisson's contributions, is provided by Hald. Two historical accounts, one covering the development from Laplace to Cauchy, the second the contributions by von Mises, Pólya, Lindeberg, Lévy, and Cramér during the 1920s, are given by Hans Fischer. Le Cam describes a period around 1935. Bernstein presents a historical discussion focusing on the work of Pafnuty Chebyshev and his students Andrey Markov and Aleksandr Lyapunov that led to the first proofs of the CLT in a general setting.

A curious footnote to the history of the Central Limit Theorem is that a proof of a result similar to the 1922 Lindeberg CLT was the subject of Alan Turing's 1934 Fellowship Dissertation for King's College at the University of Cambridge. Only after submitting the work did Turing learn it had already been proved. Consequently, Turing's dissertation was not published.^[25]

See also

• Asymptotic equipartition property
• Asymptotic distribution
• Bates distribution
• Benford's law – result of extension of CLT to product of random variables.
• Berry–Esseen theorem
• Central limit theorem for directional statistics – Central limit theorem applied to the case of directional statistics
• Delta method – to compute the limit distribution of a function of a random variable.
• Erdős–Kac theorem – connects the number of prime factors of an integer with the normal probability distribution
• Fisher–Tippett–Gnedenko theorem – limit theorem for extremum values (such as)
• Irwin–Hall distribution
• Markov chain central limit theorem
• Normal distribution
• Tweedie convergence theorem – a theorem that can be considered to bridge between the central limit theorem and the Poisson convergence theorem^[26]

References

• Bárány. Imre. Imre Bárány. Vu. Van. 2007. Central limit theorems for Gaussian polytopes. Annals of Probability. Institute of Mathematical Statistics . 35. 4. 1593–1621 . math/0610192 . 10.1214/009117906000000791 . 9128253.
• Book: Bauer, Heinz. Measure and Integration Theory. de Gruyter . Berlin . 2001 . 3110167190.
• Book: Billingsley, Patrick. 1995 . Probability and Measure. 3rd. John Wiley & Sons . 0-471-00710-2.
• Bradley. Richard. Basic Properties of Strong Mixing Conditions. A Survey and Some Open Questions . Probability Surveys. 2005 . 2. 107–144 . math/0511078 . 10.1214/154957805100000104 . 2005math.....11078B. 8395267.
• Book: Bradley, Richard. Introduction to Strong Mixing Conditions . 1st. 2007. 978-0-9740427-9-4 . Kendrick Press. Heber City, UT.
• Dinov . Ivo . Christou . Nicolas . Sanchez . Juana . 2008 . Central Limit Theorem: New SOCR Applet and Demonstration Activity . Journal of Statistics Education . ASA . 16 . 2 . 1–15 . 10.1080/10691898.2008.11889560 . 3152447 . 21833159 . 2008-08-23 . 2016-03-03 . https://web.archive.org/web/20160303185802/http://www.amstat.org/publications/jse/v16n2/dinov.html . dead .
• Book: Durrett, Richard. Rick Durrett. Probability: theory and examples. 3rd . 2004 . Cambridge University Press. 0521765390.
• Book: Fischer, Hans. 2011. A History of the Central Limit Theorem: From Classical to Modern Probability Theory. Sources and Studies in the History of Mathematics and Physical Sciences . New York . Springer . 978-0-387-87856-0 . 10.1007/978-0-387-87857-7 . 1226.60004. 2743162 . https://web.archive.org/web/20171031171033/http://www.medicine.mcgill.ca/epidemiology/hanley/bios601/GaussianModel/HistoryCentralLimitTheorem.pdf . 2017-10-31 . live.
• Gaposhkin. V. F.. 1966 . Lacunary series and independent functions . Russian Mathematical Surveys. 21. 6 . 1–82. 10.1070/RM1966v021n06ABEH001196 . 1966RuMaS..21....1G. 250833638 . .
• Klartag . Bo'az . 2007 . A central limit theorem for convex sets . Inventiones Mathematicae . 168 . 1 . 91–131 . 10.1007/s00222-006-0028-8 . math/0605014. 2007InMat.168...91K . 119169773.
• Klartag . Bo'az . 2008 . A Berry–Esseen type inequality for convex bodies with an unconditional basis . Probability Theory and Related Fields . 10.1007/s00440-008-0158-6 . 0705.0832 . 145 . 1–2 . 1–33 . 10163322.

External links

• Central Limit Theorem at Khan Academy
  • • A music video demonstrating the central limit theorem with a Galton board by Carl McTague

Notes and References

1. Book: Montgomery . Douglas C. . Applied Statistics and Probability for Engineers . 6th . Runger . George C. . Wiley . 2014 . 9781118539712 . 241.
2. Book: van der Vaart, A.W. . Asymptotic statistics . 1998 . Cambridge University Press . New York, NY . 978-0-521-49603-2 . 98015176.
3. V. . Bentkus . A Lyapunov-type bound in \R ^{d} . Theory Probab. Appl. . 49 . 2005 . 2 . 311–323 . 10.1137/S0040585X97981123 .
4. Le Cam . L. . The Central Limit Theorem around 1935 . Statistical Science . February 1986 . 1 . 1 . 78–91 . 2245503.
5. Book: Lévy . Paul . Theorie de l'addition des variables aleatoires [Combination theory of unpredictable variables] . 1937 . Gauthier-Villars . Paris.
6. Book: Gnedenko . Boris Vladimirovich . Kologorov . Andreĭ Nikolaevich . Doob . Joseph L. . Hsu . Pao-Lu . Limit distributions for sums of independent random variables . 1968 . Addison-wesley . Reading, MA.
7. Book: Nolan . John P. . Univariate stable distributions, Models for Heavy Tailed Data . Springer Series in Operations Research and Financial Engineering . 2020 . Springer . Switzerland . 10.1007/978-3-030-52915-4 . 978-3-030-52914-7 . 226648987 .
8. Book: An Introduction to Stochastic Processes in Physics. Johns Hopkins University Press. 2003 . 10.56021/9780801868665 . 2016-08-11 . Lemons . Don . 9780801876387 .
9. Stein . C. . Charles Stein (statistician). A bound for the error in the normal approximation to the distribution of a sum of dependent random variables. Proceedings of the Sixth Berkeley Symposium on Mathematical Statistics and Probability. 583–602. 1972. 6 . 2 . 402873 . 0278.60026.
10. Book: Normal approximation by Stein's method. Springer. 2011. Chen . L. H. Y. . Goldstein . L. . Shao . Q. M. . 978-3-642-15006-7.
11. Brewer . J.K. . 1985 . Behavioral statistics textbooks: Source of myths and misconceptions? . Journal of Educational Statistics . 10 . 3 . 252–268. 10.3102/10769986010003252 . 119611584 .
12. Yu, C.; Behrens, J.; Spencer, A. Identification of Misconception in the Central Limit Theorem and Related Concepts, American Educational Research Association lecture 19 April 1995
13. Sotos . A.E.C. . Vanhoof . S. . Van den Noortgate . W. . Onghena . P. . 2007 . Students' misconceptions of statistical inference: A review of the empirical evidence from research on statistics education . Educational Research Review . 2 . 2 . 98–113. 10.1016/j.edurev.2007.04.001 .
14. Web site: 2023-06-02 . Sampling distribution of the sample mean (video) Khan Academy . 2023-10-08 . https://web.archive.org/web/20230602200310/https://www.khanacademy.org/math/statistics-probability/sampling-distributions-library/sample-means/v/sampling-distribution-of-the-sample-mean . 2 June 2023 .
15. Book: Rosenthal, Jeffrey Seth . 2000 . A First Look at Rigorous Probability Theory . World Scientific . 981-02-4322-7 . Theorem 5.3.4, p. 47.
16. Book: Johnson, Oliver Thomas . 2004 . Information Theory and the Central Limit Theorem . Imperial College Press . 1-86094-473-6 . 88.
17. Book: Vladimir V. . Uchaikin . V.M. . Zolotarev . 1999 . Chance and Stability: Stable distributions and their applications . VSP . 90-6764-301-7 . 61–62.
18. Book: Borodin . A. N. . Ibragimov . I. A. . Sudakov . V. N. . 1995 . Limit Theorems for Functionals of Random Walks . AMS Bookstore . 0-8218-0438-3 . Theorem 1.1, p. 8.
19. Book: Petrov, V. V. . Sums of Independent Random Variables. 1976. Springer-Verlag. New York-Heidelberg . 9783642658099 . ch. 7.
20. Book: Kotani . M. . Sunada . Toshikazu . Toshikazu Sunada . 2003 . Spectral geometry of crystal lattices . Contemporary Math . 338 . 271–305 . 978-0-8218-4269-0.
21. Book: Sunada, Toshikazu . Toshikazu Sunada . 2012 . Topological Crystallography – With a View Towards Discrete Geometric Analysis. Surveys and Tutorials in the Applied Mathematical Sciences . 6 . Springer . 978-4-431-54177-6.
22. Marasinghe . M. . Meeker . W. . Cook . D. . Shin . T. S. . Aug 1994 . Using graphics and simulation to teach statistical concepts . Annual meeting of the American Statistician Association, Toronto, Canada.
23. Book: Galton, F. . 1889 . Natural Inheritance . 66.
24. Pólya. George. George Pólya. 1920. Über den zentralen Grenzwertsatz der Wahrscheinlichkeitsrechnung und das Momentenproblem. On the central limit theorem of probability calculation and the problem of moments . Mathematische Zeitschrift. 8. 171–181 . de . 10.1007/BF01206525 . 3–4. 123063388.
25. S. L. . Zabell . Alan Turing and the Central Limit Theorem . American Mathematical Monthly . 102 . 1995 . 6 . 483–494 . 10.1080/00029890.1995.12004608 .
26. Book: Jørgensen, Bent . 1997. The Theory of Dispersion Models. Chapman & Hall . 978-0412997112.