Normal distribution

From Wikipedia, the free encyclopedia
Jump to: navigation, search
This article is about the univariate normal distribution. For normally distributed vectors, see Multivariate normal distribution.
Normal
Probability density function
Probability density function for the normal distribution
The red curve is the standard normal distribution
Cumulative distribution function
Cumulative distribution function for the normal distribution
Notation \mathcal{N}(\mu,\,\sigma^2)
Parameters μR — mean (location)
σ2 > 0 — variance (squared scale)
Support xR
pdf \frac{1}{\sigma\sqrt{2\pi}}\, e^{-\frac{(x - \mu)^2}{2 \sigma^2}}
CDF \frac12\left[1 + \operatorname{erf}\left( \frac{x-\mu}{\sigma\sqrt{2}}\right)\right]
Quantile \mu+\sigma\sqrt{2}\,\operatorname{erf}^{-1}(2F-1)
Mean μ
Median μ
Mode μ
Variance \sigma^2\,
Skewness 0
Ex. kurtosis 0
Entropy \frac12 \ln(2 \pi e \, \sigma^2)
MGF \exp\{ \mu t + \frac{1}{2}\sigma^2t^2 \}
CF \exp \{ i\mu t - \frac{1}{2}\sigma^2 t^2 \}
Fisher information \begin{pmatrix}1/\sigma^2&0\\0&1/(2\sigma^4)\end{pmatrix}

In probability theory, the normal (or Gaussian) distribution is a very commonly occurring continuous probability distribution—a function that tells the probability that any real observation will fall between any two real limits or real numbers, as the curve approaches zero on either side. Normal distributions are extremely important in statistics and are often used in the natural and social sciences for real-valued random variables whose distributions are not known.[1][2]

The normal distribution is immensely useful because of the central limit theorem, which states that, under mild conditions, the mean of many random variables independently drawn from the same distribution is distributed approximately normally, irrespective of the form of the original distribution: physical quantities that are expected to be the sum of many independent processes (such as measurement errors) often have a distribution very close to the normal. Moreover, many results and methods (such as propagation of uncertainty and least squares parameter fitting) can be derived analytically in explicit form when the relevant variables are normally distributed.

The Gaussian distribution is sometimes informally called the bell curve. However, many other distributions are bell-shaped (such as Cauchy's, Student's, and logistic). The terms Gaussian function and Gaussian bell curve are also ambiguous because they sometimes refer to multiples of the normal distribution that cannot be directly interpreted in terms of probabilities.

A normal distribution is


f(x, \mu, \sigma) = \frac{1}{\sigma\sqrt{2\pi}} e^{ -\frac{(x-\mu)^2}{2\sigma^2} }

The parameter μ in this definition is the mean or expectation of the distribution (and also its median and mode). The parameter σ is its standard deviation; its variance is therefore σ 2. A random variable with a Gaussian distribution is said to be normally distributed and is called a normal deviate.

If μ = 0 and σ = 1, the distribution is called the standard normal distribution or the unit normal distribution, and a random variable with that distribution is a standard normal deviate.

The normal distribution is the only absolutely continuous distribution all of whose cumulants beyond the first two (i.e., other than the mean and variance) are zero. It is also the continuous distribution with the maximum entropy for a given mean and variance.[3][4]

The normal distribution is a subclass of the elliptical distributions. The normal distribution is symmetric about its mean, and is non-zero over the entire real line. As such it may not be a suitable model for variables that are inherently positive or strongly skewed, such as the weight of a person or the price of a share. Such variables may be better described by other distributions, such as the log-normal distribution or the Pareto distribution.

The value of the normal distribution is practically zero when the value x lies more than a few standard deviations away from the mean. Therefore, it may not be an appropriate model when one expects a significant fraction of outliers—values that lie many standard deviations away from the mean — and least squares and other statistical inference methods that are optimal for normally distributed variables often become highly unreliable when applied to such data. In those cases, a more heavy-tailed distribution should be assumed and the appropriate robust statistical inference methods applied.

The Gaussian distribution belongs to the family of stable distributions which are the attractors of sums of independent, identically distributed distributions whether or not the mean or variance is finite. Except for the Gaussian which is a limiting case, all stable distributions have heavy tails and infinite variance.

Definition[edit]

Standard normal distribution[edit]

The simplest case of a normal distribution is known as the standard normal distribution. This is a special case where μ=0 and σ=1, and it is described by this probability density function:

\phi(x) = \frac{e^{- \frac{\scriptscriptstyle 1}{\scriptscriptstyle 2} x^2}}{\sqrt{2\pi}}\,

The factor \scriptstyle\ 1/\sqrt{2\pi} in this expression ensures that the total area under the curve ϕ(x) is equal to one.[5] The 1/2 in the exponent ensures that the distribution has unit variance (and therefore also unit standard deviation). This function is symmetric around x=0, where it attains its maximum value 1/\sqrt{2\pi}; and has inflection points at +1 and −1.

Authors may differ also on which normal distribution should be called the "standard" one. Gauss himself defined the standard normal as having variance σ2 = 1/2, that is

\phi(x) = \frac{e^{-x^2}}{\sqrt\pi}\,

Stigler[6] goes even further, defining the standard normal with variance σ2 = 1/2π :

 \phi(x) = e^{-\pi x^2}

General normal distribution[edit]

Any normal distribution is a version of the standard normal distribution whose domain has been stretched by a factor σ (the standard deviation) and then translated by μ (the mean value):


f(x, \mu, \sigma) =\frac{1}{\sigma} \phi\left(\frac{x-\mu}{\sigma}\right).

The probability density must be scaled by 1/\sigma so that the integral is still 1.

If Z is a standard normal deviate, then X = + μ will have a normal distribution with expected value μ and standard deviation σ. Conversely, if X is a general normal deviate, then Z = (Xμ)/σ will have a standard normal distribution.

Every normal distribution is the exponential of a quadratic function:

    f(x) = e^{a x^2 + b x + c}

where a is negative and c is b^2/(4a)+\ln(-a/\pi)/2. In this form, the mean value μ is −b/(2a), and the variance σ2 is −1/(2a). For the standard normal distribution, a is −1/2, b is zero, and c is -\ln(2\pi)/2.

Notation[edit]

The standard Gaussian distribution (with zero mean and unit variance) is often denoted with the Greek letter ϕ (phi).[7] The alternative form of the Greek phi letter, φ, is also used quite often.

The normal distribution is also often denoted by N(μ, σ2).[8] Thus when a random variable X is distributed normally with mean μ and variance σ2, we write

X\ \sim\ \mathcal{N}(\mu,\,\sigma^2).

Alternative parameterizations[edit]

Some authors advocate using the precision τ as the parameter defining the width of the distribution, instead of the deviation σ or the variance σ2. The precision is normally defined as the reciprocal of the variance, 1/σ2.[9] The formula for the distribution then becomes

f(x) = \sqrt{\frac{\tau}{2\pi}}\, e^{\frac{-\tau(x-\mu)^2}{2}}.

This choice is claimed to have advantages in numerical computations when σ is very close to zero and simplify formulas in some contexts, such as in the Bayesian inference of variables with multivariate normal distribution.

Occasionally, the precision τ is 1/σ, the reciprocal of the standard deviation; so that

f(x) = \frac{\tau}{\sqrt{2\pi}}\, e^{\frac{-\tau^2(x-\mu)^2}{2}}.

According to Stigler, this formulation is advantageous because of a much simpler and easier-to-remember formula, the fact that the pdf has unit height at zero, and simple approximate formulas for the quantiles of the distribution.

Properties[edit]

Symmetries and derivatives[edit]

The normal distribution f(x), with any mean μ and any positive deviation σ, has the following properties:

  • It is symmetric around the point x = μ, which is at the same time the mode, the median and the mean of the distribution.[10]
  • It is unimodal: its first derivative is positive for x < μ, negative for x > μ, and zero only at x = μ.
  • Its density has two inflection points (where the second derivative of f is zero and changes sign), located one standard deviation away from the mean, namely at x = μ − σ and x = μ + σ.[10]
  • Its density is log-concave.[10]
  • Its density is infinitely differentiable, indeed supersmooth of order 2.[11]
  • Its second derivative f′′(x) is equal to its derivative with respect to its variance σ2

Furthermore, the density ϕ of the standard normal distribution (with μ = 0 and σ = 1) also has the following properties:

  • Its first derivative ϕ′(x) is −(x).
  • Its second derivative ϕ′′(x) is (x2 − 1)ϕ(x)
  • More generally, its n-th derivative ϕ(n)(x) is (−1)nHn(x)ϕ(x), where Hn is the Hermite polynomial of order n.[12]
  • It satisfies the differential equation

\sigma ^2 f'(x)+f(x) (x-\mu )=0,\qquad f(0)=\frac{e^{-\mu ^2/(2\sigma ^2)}}{\sqrt{2 \pi } \sigma }
or

f'(x)+\tau  f(x) (x-\mu )=0,\qquad f(0)=\frac{\sqrt{\tau } e^{-\mu^2 \tau/2}}{\sqrt{2 \pi }}.

Moments[edit]

The plain and absolute moments of a variable X are the expected values of Xp and |X|p,respectively. If the expected value μ of X is zero, these parameters are called central moments. Usually we are interested only in moments with integer order p.

If X has a normal distribution, these moments exist and are finite for any p whose real part is greater than −1. For any non-negative integer p, the plain central moments are


    \mathrm{E}\left[X^p\right] =
      \begin{cases}
        0 & \text{if }p\text{ is odd,} \\
        \sigma^p\,(p-1)!! & \text{if }p\text{ is even.}
      \end{cases}

Here n!! denotes the double factorial, that is, the product of every odd number from n to 1.

The central absolute moments coincide with plain moments for all even orders, but are nonzero for odd orders. For any non-negative integer p,



    \operatorname{E}\left[|X|^p\right] =
      \sigma^p\,(p-1)!! \cdot \left.\begin{cases}
        \sqrt{\frac{2}{\pi}} & \text{if }p\text{ is odd} \\
        1 & \text{if }p\text{ is even}
      \end{cases}\right\}
    = \sigma^p \cdot \frac{2^{\frac{p}{2}}\Gamma\left(\frac{p+1}{2}\right)}{\sqrt{\pi}}

The last formula is valid also for any non-integer p > −1. When the mean μ is not zero, the plain and absolute moments can be expressed in terms of confluent hypergeometric functions 1F1 and U.[citation needed]


 \operatorname{E} \left[ X^p \right] =\sigma^p \cdot (-i\sqrt{2}\sgn\mu)^p \; U\left( {-\frac{1}{2}p},\, \frac{1}{2},\, -\frac{1}{2}(\mu/\sigma)^2 \right),

 \operatorname{E} \left[ |X|^p \right] =\sigma^p \cdot 2^{\frac p 2} \frac {\Gamma\left(\frac{1+p}{2}\right)}{\sqrt\pi}\; _1F_1\left( {-\frac{1}{2}p},\, \frac{1}{2},\, -\frac{1}{2}(\mu/\sigma)^2 \right).

These expressions remain valid even if p is not integer. See also generalized Hermite polynomials.

Order Non-central moment Central moment
1 μ 0
2 μ2 + σ2 σ 2
3 μ3 + 3μσ2 0
4 μ4 + 6μ2σ2 + 3σ4 3σ 4
5 μ5 + 10μ3σ2 + 15μσ4 0
6 μ6 + 15μ4σ2 + 45μ2σ4 + 15σ6 15σ 6
7 μ7 + 21μ5σ2 + 105μ3σ4 + 105μσ6 0
8 μ8 + 28μ6σ2 + 210μ4σ4 + 420μ2σ6 + 105σ8 105σ 8

Fourier transform and characteristic function[edit]

The Fourier transform of a normal distribution f with mean μ and deviation σ is[13]


    \hat\phi(t) = \int_{-\infty}^\infty\! f(x)e^{itx} dx = e^{\mathbf{i}\mu t} e^{- \frac12 (\sigma t)^2}

where i is the imaginary unit. If the mean μ is zero, the first factor is 1, and the Fourier transform is also a normal distribution on the frequency domain, with mean 0 and standard deviation 1/σ. In particular, the standard normal distribution ϕ (with μ=0 and σ=1) is an eigenfunction of the Fourier transform.

In probability theory, the Fourier transform of the probability distribution of a real-valued random variable X is called the characteristic function of that variable, and can be defined as the expected value of eitX, as a function of the real variable t (the frequency parameter of the Fourier transform). This definition can be analytically extended to a complex-value parameter t.[14]

Moment and cumulant generating functions[edit]

The moment generating function of a real random variable X is the expected value of etX, as a function of the real parameter t. For a normal distribution with mean μ and deviation σ, the moment generating function exists and is equal to

    M(t) = \hat \phi(-\mathbf{i}t) = e^{ \mu t} e^{\frac12 \sigma^2 t^2 }

The cumulant generating function is the logarithm of the moment generating function, namely

    g(t) = \ln M(t) = \mu t + \frac{1}{2} \sigma^2 t^2

Since this is a quadratic polynomial in t, only the first two cumulants are nonzero, namely the mean μ and the variance σ2.

Cumulative distribution function[edit]

The cumulative distribution function (CDF) of the standard normal distribution, usually denoted with the capital Greek letter \Phi (phi), is the integral

\Phi(x)\; = \;\frac{1}{\sqrt{2\pi}} \int_{-\infty}^x e^{-t^2/2} \, dt

Therefore here are some trivial results from area under bell curve -

\Phi({-\infty}) = 0 = 0\%
\Phi(0) = 0.5 = 50\%
\Phi({\infty}) = 1= 100\%
\Phi(x) = 1- \Phi(-x) and therefore \Phi(x) + \Phi(-x) = 100\%

In statistics one often uses the related error function, or erf(x), defined as the probability of a random variable with normal distribution of mean 0 and variance 1/2 falling in the range [-x, x]; that is

\operatorname{erf}(x)\; =\; \frac{1}{\sqrt{\pi}} \int_{-x}^x e^{-t^2} \, dt

These integrals cannot be expressed in terms of elementary functions, and are often said to be special functions *. They are closely related, namely

 \Phi(x)\; =\; \frac12\left[1 + \operatorname{erf}\left(\frac{x}{\sqrt{2}}\right)\right]

For a generic normal distribution f with mean μ and deviation σ, the cumulative distribution function is

F(x)\;=\;\Phi\left(\frac{x-\mu}{\sigma}\right)\;=\; \frac12\left[1 + \operatorname{erf}\left(\frac{x-\mu}{\sigma\sqrt{2}}\right)\right]

The complement of the standard normal CDF, Q(x) = 1 - \Phi(x), is often called the Q-function, especially in engineering texts.[15][16] It gives the probability that the value of a standard normal random variable X will exceed x. Other definitions of the Q-function, all of which are simple transformations of \Phi, are also used occasionally.[17]

The graph of the standard normal CDF \Phi has 2-fold rotational symmetry around the point (0,1/2); that is, \Phi(-x) = 1 - \Phi(x). Its antiderivative (indefinite integral) \int \Phi(x)\, dx is \int \Phi(x)\, dx = x\Phi(x) + \phi(x).

  • The cumulative distribution function (CDF) of the standard normal distribution can be expanded by Integration by parts into a series:
\Phi(x)\; =\;0.5+\frac{1}{\sqrt{2\pi}}\cdot e^{-x^2/2}\left[x+\frac{x^3}{3}+\frac{x^5}{3\cdot 5}+\cdots+\frac{x^{2n+1}}{3\cdot 5\cdot7\cdots (2n+1)}\right]

Example of Pascal function to calculate CDF (sum of first 100 elements)

function CDF(x:extended):extended;
var value,sum:extended;
    i:integer;
begin
  sum:=x;
  value:=x;
  for i:=1 to 100 do
    begin
      value:=(value*x*x/(2*i+1));
      sum:=sum+value;
    end;
  result:=0.5+(sum/sqrt(2*pi))*exp(-(x*x)/2);
end;

Standard deviation and tolerance intervals[edit]

Main article: Tolerance interval
Dark blue is less than one standard deviation away from the mean. For the normal distribution, this accounts for 68.2% of the set, while two standard deviations from the mean (medium and dark blue) account for 95.4%, and three standard deviations (light, medium, and dark blue) account for 99.7%.

About 68% of values drawn from a normal distribution are within one standard deviation σ away from the mean; about 95% of the values lie within two standard deviations; and about 99.7% are within three standard deviations. This fact is known as the 68-95-99.7 (empirical) rule, or the 3-sigma rule.

More precisely, the probability that a normal deviate lies in the range μ and μ + is given by


    F(\mu+n\sigma) - F(\mu-n\sigma) = \Phi(n)-\Phi(-n) = \mathrm{erf}\left(\frac{n}{\sqrt{2}}\right),

To 12 decimal places, the values for n = 1, 2, …, 6 are:[18]

n F(μ+) − F(μ) i.e. 1 minus … or 1 in … OEIS
1 0.682689492137 0.317310507863 3.15148718753 OEISA178647
2 0.954499736104 0.045500263896 21.9778945080 OEISA110894
3 0.997300203937 0.002699796063 370.398347345
4 0.999936657516 0.000063342484 15787.1927673
5 0.999999426697 0.000000573303 1744277.89362
6 0.999999998027 0.000000001973 506797345.897

Quantile function[edit]

The quantile function of a distribution is the inverse of the cumulative distribution function. The quantile function of the standard normal distribution is called the probit function, and can be expressed in terms of the inverse error function:


    \Phi^{-1}(p)\; =\; \sqrt2\;\operatorname{erf}^{-1}(2p - 1), \quad p\in(0,1).

For a normal random variable with mean μ and variance σ2, the quantile function is


    F^{-1}(p)
      = \mu + \sigma\Phi^{-1}(p)
      = \mu + \sigma\sqrt2\,\operatorname{erf}^{-1}(2p - 1), \quad p\in(0,1).

The quantile  \Phi^{-1}(p) of the standard normal distribution is commonly denoted as zp. These values are used in hypothesis testing, construction of confidence intervals and Q-Q plots. A normal random variable X will exceed μ + σzp with probability 1−p; and will lie outside the interval μ ± σzp with probability 2(1−p). In particular, the quantile z0.975 is 1.96; therefore a normal random variable will lie outside the interval μ ± 1.96σ in only 5% of cases.

The following table gives the multiple n of σ such that X will lie in the range μ ± with a specified probability p. These values are useful to determine tolerance interval for sample averages and other statistical estimators with normal (or asymptotically normal) distributions:[19]

F(μ + ) − F(μ) n    F(μ + ) − F(μ) n
0.80 1.281551565545 0.999 3.290526731492
0.90 1.644853626951 0.9999 3.890591886413
0.95 1.959963984540 0.99999 4.417173413469
0.98 2.326347874041 0.999999 4.891638475699
0.99 2.575829303549 0.9999999 5.326723886384
0.995 2.807033768344 0.99999999 5.730728868236
0.998 3.090232306168 0.999999999 6.109410204869

Zero-variance limit[edit]

In the limit when σ tends to zero, the probability density f(x) eventually tends to zero at any xμ, but grows without limit if x = μ, while its integral remains equal to 1. Therefore, the normal distribution cannot be defined as an ordinary function when σ = 0.

However, one can define the normal distribution with zero variance as a generalized function; specifically, as Dirac's "delta function" δ translated by the mean μ, that is f(x) = δ(xμ). Its CDF is then the Heaviside step function translated by the mean μ, namely


    F(x) = \begin{cases}
        0 & \text{if }x < \mu \\
        1 & \text{if }x \geq \mu
      \end{cases}

The central limit theorem[edit]

As the number of discrete events increases, the function begins to resemble a normal distribution
Comparison of probability density functions, p(k) for the sum of n fair 6-sided dice to show their convergence to a normal distribution with increasing n, in accordance to the central limit theorem. In the bottom-right graph, smoothed profiles of the previous graphs are rescaled, superimposed and compared with a normal distribution (black curve).
Main article: Central limit theorem

The central limit theorem states that under certain (fairly common) conditions, the sum of many random variables will have an approximately normal distribution. More specifically, where X1, …, Xn are independent and identically distributed random variables with the same arbitrary distribution, zero mean, and variance σ2; and Z is their mean scaled by \sqrt{n}

 Z = \sqrt{n}\left(\frac{1}{n}\sum_{i=1}^n X_i\right)

Then, as n increases, the probability distribution of Z will tend to the normal distribution with zero mean and variance σ2.

The theorem can be extended to variables Xi that are not independent and/or not identically distributed if certain constraints are placed on the degree of dependence and the moments of the distributions.

Many test statistics, scores, and estimators encountered in practice contain sums of certain random variables in them, and even more estimators can be represented as sums of random variables through the use of influence functions. The central limit theorem implies that those statistical parameters will have asymptotically normal distributions.

The central limit theorem also implies that certain distributions can be approximated by the normal distribution, for example:

Whether these approximations are sufficiently accurate depends on the purpose for which they are needed, and the rate of convergence to the normal distribution. It is typically the case that such approximations are less accurate in the tails of the distribution.

A general upper bound for the approximation error in the central limit theorem is given by the Berry–Esseen theorem, improvements of the approximation are given by the Edgeworth expansions.

Operations on normal deviates[edit]

The family of normal distributions is closed under linear transformations: if X is normally distributed with mean μ and deviation σ, then the variable Y = aX + b, for any real numbers a and b, is also normally distributed, with mean + b and deviation .

Also if X1 and X2 are two independent normal random variables, with means μ1, μ2 and standard deviations σ1, σ2, then their sum X1 + X2 will also be normally distributed,[proof] with mean μ1 + μ2 and variance \sigma_1^2 + \sigma_2^2.

In particular, if X and Y are independent normal deviates with zero mean and variance σ2, then X + Y and X − Y are also independent and normally distributed, with zero mean and variance 2σ2. This is a special case of the polarization identity.[21]

Also, if X1, X2 are two independent normal deviates with mean μ and deviation σ, and a, b are arbitrary real numbers, then the variable


    X_3 = \frac{aX_1 + bX_2 - (a+b)\mu}{\sqrt{a^2+b^2}} + \mu

is also normally distributed with mean μ and deviation σ. It follows that the normal distribution is stable (with exponent α = 2).

More generally, any linear combination of independent normal deviates is a normal deviate.

Infinite divisibility and Cramér's theorem[edit]

For any positive integer n, any normal distribution with mean μ and variance σ2 is the distribution of the sum of n independent normal deviates, each with mean μ/n and variance σ2/n. This property is called infinite divisibility.[22]

Conversely, if X1 and X2 are independent random variables and their sum X1 + X2 has a normal distribution, then both X1 and X2 must be normal deviates.[23]

This result is known as Cramér's decomposition theorem, and is equivalent to saying that the convolution of two distributions is normal if and only if both are normal. Cramér's theorem implies that a linear combination of independent non-Gaussian variables will never have an exactly normal distribution, although it may approach it arbitrarily close.[24]

Bernstein's theorem[edit]

Bernstein's theorem states that if X and Y are independent and X + Y and X − Y are also independent, then both X and Y must necessarily have normal distributions.[25][26]

More generally, if X1, …, Xn are independent random variables, then two distinct linear combinations ∑akXk and ∑bkXk will be independent if and only if all Xk's are normal and akbkσ 2
k
 
= 0
, where σ 2
k
 
denotes the variance of Xk.[25]

Other properties[edit]

  1. If the characteristic function φX of some random variable X is of the form φX(t) = eQ(t), where Q(t) is a polynomial, then the Marcinkiewicz theorem (named after Józef Marcinkiewicz) asserts that Q can be at most a quadratic polynomial, and therefore X a normal random variable.[24] The consequence of this result is that the normal distribution is the only distribution with a finite number (two) of non-zero cumulants.
  2. If X and Y are jointly normal and uncorrelated, then they are independent. The requirement that X and Y should be jointly normal is essential, without it the property does not hold.[27][28][proof] For non-normal random variables uncorrelatedness does not imply independence.
  3. The Kullback–Leibler divergence of one normal distributions X1N(μ1, σ21 )from another X2N(μ2, σ22 )is given by:[29]
    
    D_\mathrm{KL}( X_1 \,\|\, X_2 ) = \frac{(\mu_1 - \mu_2)^2}{2\sigma_2^2} \,+\, \frac12\left(\, \frac{\sigma_1^2}{\sigma_2^2} - 1 - \ln\frac{\sigma_1^2}{\sigma_2^2} \,\right)\ .

    The Hellinger distance between the same distributions is equal to

    
    H^2(X_1,X_2) = 1 \,-\, \sqrt{\frac{2\sigma_1\sigma_2}{\sigma_1^2+\sigma_2^2}} \;
                           e^{-\frac{1}{4}\frac{(\mu_1-\mu_2)^2}{\sigma_1^2+\sigma_2^2}}\ .
  4. The Fisher information matrix for a normal distribution is diagonal and takes the form
    
    \mathcal I = \begin{pmatrix} \frac{1}{\sigma^2} & 0 \\ 0 & \frac{1}{2\sigma^4} \end{pmatrix}
  5. Normal distributions belongs to an exponential family with natural parameters  \scriptstyle\theta_1=\frac{\mu}{\sigma^2} and \scriptstyle\theta_2=\frac{-1}{2\sigma^2}, and natural statistics x and x2. The dual, expectation parameters for normal distribution are η1 = μ and η2 = μ2 + σ2.
  6. The conjugate prior of the mean of a normal distribution is another normal distribution.[30] Specifically, if x1, …, xn are iid N(μ, σ2) and the prior is μ ~ N(μ0, σ2
    0
    )
    , then the posterior distribution for the estimator of μ will be
    
    \mu | x_1,\ldots,x_n\ \sim\ \mathcal{N}\left( \frac{\frac{\sigma^2}{n}\mu_0 + \sigma_0^2\bar{x}}{\frac{\sigma^2}{n}+\sigma_0^2},\ \left( \frac{n}{\sigma^2} + \frac{1}{\sigma_0^2} \right)^{\!-1} \right)
  7. Of all probability distributions over the reals with mean μ and variance σ2, the normal distribution N(μ, σ2) is the one with the maximum entropy.[31]
  8. The family of normal distributions forms a manifold with constant curvature −1. The same family is flat with respect to the (±1)-connections ∇(e) and ∇(m).[32]

Related distributions[edit]

Operations on a single random variable[edit]

If X is distributed normally with mean μ and variance σ2, then

Combination of two independent random variables[edit]

If X1 and X2 are two independent standard normal random variables with mean 0 and variance 1, then

Combination of two or more independent random variables[edit]

  • If X1, X2, …, Xn are independent standard normal random variables, then the sum of their squares has the chi-squared distribution with n degrees of freedom
X_1^2 + \cdots + X_n^2\ \sim\ \chi_n^2..
t = \frac{\overline X - \mu}{S/\sqrt{n}} = \frac{\frac{1}{n}(X_1+\cdots+X_n) - \mu}{\sqrt{\frac{1}{n(n-1)}\left[(X_1-\overline X)^2+\cdots+(X_n-\overline X)^2\right]}} \ \sim\ t_{n-1}.
  • If X1, …, Xn, Y1, …, Ym are independent standard normal random variables, then the ratio of their normalized sums of squares will have the F-distribution with (n, m) degrees of freedom:[36]
F = \frac{\left(X_1^2+X_2^2+\cdots+X_n^2\right)/n}{\left(Y_1^2+Y_2^2+\cdots+Y_m^2\right)/m}\ \sim\ F_{n,\,m}.

Operations on the density function[edit]

The split normal distribution is most directly defined in terms of joining scaled sections of the density functions of different normal distributions and rescaling the density to integrate to one. The truncated normal distribution results from rescaling a section of a single density function.

Extensions[edit]

The notion of normal distribution, being one of the most important distributions in probability theory, has been extended far beyond the standard framework of the univariate (that is one-dimensional) case (Case 1). All these extensions are also called normal or Gaussian laws, so a certain ambiguity in names exists.

  • The multivariate normal distribution describes the Gaussian law in the k-dimensional Euclidean space. A vector XRk is multivariate-normally distributed if any linear combination of its components k
    j=1
    aj Xj
    has a (univariate) normal distribution. The variance of X is a k×k symmetric positive-definite matrix V. The multivariate normal distribution is a special case of the elliptical distributions. As such, its iso-density loci in the k = 2 case are ellipses and in the case of arbitrary k are ellipsoids.
  • Rectified Gaussian distribution a rectified version of normal distribution with all the negative elements reset to 0
  • Complex normal distribution deals with the complex normal vectors. A complex vector XCk is said to be normal if both its real and imaginary components jointly possess a 2k-dimensional multivariate normal distribution. The variance-covariance structure of X is described by two matrices: the variance matrix Γ, and the relation matrix C.
  • Matrix normal distribution describes the case of normally distributed matrices.
  • Gaussian processes are the normally distributed stochastic processes. These can be viewed as elements of some infinite-dimensional Hilbert space H, and thus are the analogues of multivariate normal vectors for the case k = ∞. A random element hH is said to be normal if for any constant aH the scalar product (a, h) has a (univariate) normal distribution. The variance structure of such Gaussian random element can be described in terms of the linear covariance operator K: H → H. Several Gaussian processes became popular enough to have their own names:
  • Gaussian q-distribution is an abstract mathematical construction that represents a "q-analogue" of the normal distribution.
  • the q-Gaussian is an analogue of the Gaussian distribution, in the sense that it maximises the Tsallis entropy, and is one type of Tsallis distribution. Note that this distribution is different from the Gaussian q-distribution above.

One of the main practical uses of the Gaussian law is to model the empirical distributions of many different random variables encountered in practice. In such case a possible extension would be a richer family of distributions, having more than two parameters and therefore being able to fit the empirical distribution more accurately. The examples of such extensions are:

  • Pearson distribution— a four-parametric family of probability distributions that extend the normal law to include different skewness and kurtosis values.

Normality tests[edit]

Main article: Normality tests

Normality tests assess the likelihood that the given data set {x1, …, xn} comes from a normal distribution. Typically the null hypothesis H0 is that the observations are distributed normally with unspecified mean μ and variance σ2, versus the alternative Ha that the distribution is arbitrary. Many tests (over 40) have been devised for this problem, the more prominent of them are outlined below:

  • "Visual" tests are more intuitively appealing but subjective at the same time, as they rely on informal human judgement to accept or reject the null hypothesis.
    • Q-Q plot— is a plot of the sorted values from the data set against the expected values of the corresponding quantiles from the standard normal distribution. That is, it's a plot of point of the form (Φ−1(pk), x(k)), where plotting points pk are equal to pk = (k − α)/(n + 1 − 2α) and α is an adjustment constant, which can be anything between 0 and 1. If the null hypothesis is true, the plotted points should approximately lie on a straight line.
    • P-P plot— similar to the Q-Q plot, but used much less frequently. This method consists of plotting the points (Φ(z(k)), pk), where \scriptstyle z_{(k)} = (x_{(k)}-\hat\mu)/\hat\sigma. For normally distributed data this plot should lie on a 45° line between (0, 0) and (1, 1).
    • Shapiro-Wilk test employs the fact that the line in the Q-Q plot has the slope of σ. The test compares the least squares estimate of that slope with the value of the sample variance, and rejects the null hypothesis if these two quantities differ significantly.
    • Normal probability plot (rankit plot)
  • Moment tests:
  • Empirical distribution function tests:

Estimation of parameters[edit]

It is often the case that we don't know the parameters of the normal distribution, but instead want to estimate them. That is, having a sample (x1, …, xn) from a normal N(μ, σ2) population we would like to learn the approximate values of parameters μ and σ2. The standard approach to this problem is the maximum likelihood method, which requires maximization of the log-likelihood function:


   \ln\mathcal{L}(\mu,\sigma^2)
     = \sum_{i=1}^n \ln f(x_i;\,\mu,\sigma^2)
     = -\frac{n}{2}\ln(2\pi) - \frac{n}{2}\ln\sigma^2 - \frac{1}{2\sigma^2}\sum_{i=1}^n (x_i-\mu)^2.

Taking derivatives with respect to μ and σ2 and solving the resulting system of first order conditions yields the maximum likelihood estimates:


    \hat{\mu} = \overline{x} \equiv \frac{1}{n}\sum_{i=1}^n x_i, \qquad
    \hat{\sigma}^2 = \frac{1}{n} \sum_{i=1}^n (x_i - \overline{x})^2.

Estimator \scriptstyle\hat\mu is called the sample mean, since it is the arithmetic mean of all observations. The statistic \scriptstyle\overline{x} is complete and sufficient for μ, and therefore by the Lehmann–Scheffé theorem, \scriptstyle\hat\mu is the uniformly minimum variance unbiased (UMVU) estimator.[37] In finite samples it is distributed normally:


    \hat\mu \ \sim\ \mathcal{N}(\mu,\,\,\sigma^2\!\!\;/n).

The variance of this estimator is equal to the μμ-element of the inverse Fisher information matrix \scriptstyle\mathcal{I}^{-1}. This implies that the estimator is finite-sample efficient. Of practical importance is the fact that the standard error of \scriptstyle\hat\mu is proportional to \scriptstyle1/\sqrt{n}, that is, if one wishes to decrease the standard error by a factor of 10, one must increase the number of points in the sample by a factor of 100. This fact is widely used in determining sample sizes for opinion polls and the number of trials in Monte Carlo simulations.

From the standpoint of the asymptotic theory, \scriptstyle\hat\mu is consistent, that is, it converges in probability to μ as n → ∞. The estimator is also asymptotically normal, which is a simple corollary of the fact that it is normal in finite samples:


    \sqrt{n}(\hat\mu-\mu) \ \xrightarrow{d}\ \mathcal{N}(0,\,\sigma^2).

The estimator \scriptstyle\hat\sigma^2 is called the sample variance, since it is the variance of the sample (x1, …, xn). In practice, another estimator is often used instead of the \scriptstyle\hat\sigma^2. This other estimator is denoted s2, and is also called the sample variance, which represents a certain ambiguity in terminology; its square root s is called the sample standard deviation. The estimator s2 differs from \scriptstyle\hat\sigma^2 by having (n − 1) instead of n in the denominator (the so-called Bessel's correction):


    s^2 = \frac{n}{n-1}\,\hat\sigma^2 = \frac{1}{n-1} \sum_{i=1}^n (x_i - \overline{x})^2.

The difference between s2 and \scriptstyle\hat\sigma^2 becomes negligibly small for large n's. In finite samples however, the motivation behind the use of s2 is that it is an unbiased estimator of the underlying parameter σ2, whereas \scriptstyle\hat\sigma^2 is biased. Also, by the Lehmann–Scheffé theorem the estimator s2 is uniformly minimum variance unbiased (UMVU),[37] which makes it the "best" estimator among all unbiased ones. However it can be shown that the biased estimator \scriptstyle\hat\sigma^2 is "better" than the s2 in terms of the mean squared error (MSE) criterion. In finite samples both s2 and \scriptstyle\hat\sigma^2 have scaled chi-squared distribution with (n − 1) degrees of freedom:


    s^2 \ \sim\ \frac{\sigma^2}{n-1} \cdot \chi^2_{n-1}, \qquad
    \hat\sigma^2 \ \sim\ \frac{\sigma^2}{n} \cdot \chi^2_{n-1}\ .

The first of these expressions shows that the variance of s2 is equal to 2σ4/(n−1), which is slightly greater than the σσ-element of the inverse Fisher information matrix \scriptstyle\mathcal{I}^{-1}. Thus, s2 is not an efficient estimator for σ2, and moreover, since s2 is UMVU, we can conclude that the finite-sample efficient estimator for σ2 does not exist.

Applying the asymptotic theory, both estimators s2 and \scriptstyle\hat\sigma^2 are consistent, that is they converge in probability to σ2 as the sample size n → ∞. The two estimators are also both asymptotically normal:


    \sqrt{n}(\hat\sigma^2 - \sigma^2) \simeq
    \sqrt{n}(s^2-\sigma^2)\ \xrightarrow{d}\ \mathcal{N}(0,\,2\sigma^4).

In particular, both estimators are asymptotically efficient for σ2.

By Cochran's theorem, for normal distributions the sample mean \scriptstyle\hat\mu and the sample variance s2 are independent, which means there can be no gain in considering their joint distribution. There is also a reverse theorem: if in a sample the sample mean and sample variance are independent, then the sample must have come from the normal distribution. The independence between \scriptstyle\hat\mu and s can be employed to construct the so-called t-statistic:


    t = \frac{\hat\mu-\mu}{s/\sqrt{n}} = \frac{\overline{x}-\mu}{\sqrt{\frac{1}{n(n-1)}\sum(x_i-\overline{x})^2}}\ \sim\ t_{n-1}

This quantity t has the Student's t-distribution with (n − 1) degrees of freedom, and it is an ancillary statistic (independent of the value of the parameters). Inverting the distribution of this t-statistics will allow us to construct the confidence interval for μ;[38] similarly, inverting the χ2 distribution of the statistic s2 will give us the confidence interval for σ2:[39]

\begin{align}
    & \mu \in \left[\, \hat\mu + t_{n-1,\alpha/2}\,  \frac{1}{\sqrt{n}}s,\ \ 
                      \hat\mu + t_{n-1,1-\alpha/2}\,\frac{1}{\sqrt{n}}s \,\right] \approx
              \left[\, \hat\mu - |z_{\alpha/2}|\frac{1}{\sqrt n}s,\ \ 
                      \hat\mu + |z_{\alpha/2}|\frac{1}{\sqrt n}s \,\right], \\ 
    & \sigma^2 \in \left[\, \frac{(n-1)s^2}{\chi^2_{n-1,1-\alpha/2}},\ \ 
                            \frac{(n-1)s^2}{\chi^2_{n-1,\alpha/2}} \,\right] \approx
                   \left[\, s^2 - |z_{\alpha/2}|\frac{\sqrt{2}}{\sqrt{n}}s^2,\ \ 
                           s^2 + |z_{\alpha/2}|\frac{\sqrt{2}}{\sqrt{n}}s^2 \,\right],
  \end{align}

where tk,p and χ 2
k,p
 
are the pth quantiles of the t- and χ2-distributions respectively. These confidence intervals are of the level 1 − α, meaning that the true values μ and σ2 fall outside of these intervals with probability α. In practice people usually take α = 5%, resulting in the 95% confidence intervals. The approximate formulas in the display above were derived from the asymptotic distributions of \scriptstyle\hat\mu and s2. The approximate formulas become valid for large values of n, and are more convenient for the manual calculation since the standard normal quantiles zα/2 do not depend on n. In particular, the most popular value of α = 5%, results in |z0.025| = 1.96.

Bayesian analysis of the normal distribution[edit]

Bayesian analysis of normally distributed data is complicated by the many different possibilities that may be considered:

  • Either the mean, or the variance, or neither, may be considered a fixed quantity.
  • When the variance is unknown, analysis may be done directly in terms of the variance, or in terms of the precision, the reciprocal of the variance. The reason for expressing the formulas in terms of precision is that the analysis of most cases is simplified.
  • Both univariate and multivariate cases need to be considered.
  • Either conjugate or improper prior distributions may be placed on the unknown variables.
  • An additional set of cases occurs in Bayesian linear regression, where in the basic model the data is assumed to be normally distributed, and normal priors are placed on the regression coefficients. The resulting analysis is similar to the basic cases of independent identically distributed data, but more complex.

The formulas for the non-linear-regression cases are summarized in the conjugate prior article.

The sum of two quadratics[edit]

Scalar form[edit]

The following auxiliary formula is useful for simplifying the posterior update equations, which otherwise become fairly tedious.

a(x-y)^2 + b(x-z)^2 = (a + b)\left(x - \frac{ay+bz}{a+b}\right)^2 + \frac{ab}{a+b}(y-z)^2

This equation rewrites the sum of two quadratics in x by expanding the squares, grouping the terms in x, and completing the square. Note the following about the complex constant factors attached to some of the terms:

  1. The factor \frac{ay+bz}{a+b} has the form of a weighted average of y and z.
  2. \frac{ab}{a+b} = \frac{1}{\frac{1}{a}+\frac{1}{b}} = (a^{-1} + b^{-1})^{-1}. This shows that this factor can be thought of as resulting from a situation where the reciprocals of quantities a and b add directly, so to combine a and b themselves, it's necessary to reciprocate, add, and reciprocate the result again to get back into the original units. This is exactly the sort of operation performed by the harmonic mean, so it is not surprising that \frac{ab}{a+b} is one-half the harmonic mean of a and b.

Vector form[edit]

A similar formula can be written for the sum of two vector quadratics: If x, y, z are vectors of length k, and A and B are symmetric, invertible matrices of size k\times k, then

(\mathbf{y}-\mathbf{x})'\mathbf{A}(\mathbf{y}-\mathbf{x}) + (\mathbf{x}-\mathbf{z})'\mathbf{B}(\mathbf{x}-\mathbf{z}) = (\mathbf{x} - \mathbf{c})'(\mathbf{A}+\mathbf{B})(\mathbf{x} - \mathbf{c}) + (\mathbf{y} - \mathbf{z})'(\mathbf{A}^{-1} + \mathbf{B}^{-1})^{-1}(\mathbf{y} - \mathbf{z})

where

\mathbf{c} = (\mathbf{A} + \mathbf{B})^{-1}(\mathbf{A}\mathbf{y} + \mathbf{B}\mathbf{z})

Note that the form xA x is called a quadratic form and is a scalar:

\mathbf{x}'\mathbf{A}\mathbf{x} = \sum_{i,j}a_{ij} x_i x_j

In other words, it sums up all possible combinations of products of pairs of elements from x, with a separate coefficient for each. In addition, since x_i x_j = x_j x_i, only the sum a_{ij} + a_{ji} matters for any off-diagonal elements of A, and there is no loss of generality in assuming that A is symmetric. Furthermore, if A is symmetric, then the form \mathbf{x}'\mathbf{A}\mathbf{y} = \mathbf{y}'\mathbf{A}\mathbf{x} .

The sum of differences from the mean[edit]

Another useful formula is as follows:

\sum_{i=1}^n (x_i-\mu)^2 = \sum_{i=1}^n(x_i-\bar{x})^2 + n(\bar{x} -\mu)^2

where \bar{x} = \frac{1}{n}\sum_{i=1}^n x_i.

With known variance[edit]

For a set of i.i.d. normally distributed data points X of size n where each individual point x follows x \sim \mathcal{N}(\mu, \sigma^2) with known variance σ2, the conjugate prior distribution is also normally distributed.

This can be shown more easily by rewriting the variance as the precision, i.e. using τ = 1/σ2. Then if x \sim \mathcal{N}(\mu, \tau) and \mu \sim \mathcal{N}(\mu_0, \tau_0), we proceed as follows.

First, the likelihood function is (using the formula above for the sum of differences from the mean):

\begin{align}
p(\mathbf{X}|\mu,\tau) &= \prod_{i=1}^n \sqrt{\frac{\tau}{2\pi}} \exp\left(-\frac{1}{2}\tau(x_i-\mu)^2\right) \\
&= \left(\frac{\tau}{2\pi}\right)^{\frac{n}{2}} \exp\left(-\frac{1}{2}\tau \sum_{i=1}^n (x_i-\mu)^2\right) \\
&= \left(\frac{\tau}{2\pi}\right)^{\frac{n}{2}} \exp\left[-\frac{1}{2}\tau \left(\sum_{i=1}^n(x_i-\bar{x})^2 + n(\bar{x} -\mu)^2\right)\right].
\end{align}

Then, we proceed as follows:

\begin{align}
p(\mu|\mathbf{X}) &\propto p(\mathbf{X}|\mu) p(\mu) \\
& = \left(\frac{\tau}{2\pi}\right)^{\frac{n}{2}} \exp\left[-\frac{1}{2}\tau \left(\sum_{i=1}^n(x_i-\bar{x})^2 + n(\bar{x} -\mu)^2\right)\right] \sqrt{\frac{\tau_0}{2\pi}} \exp\left(-\frac{1}{2}\tau_0(\mu-\mu_0)^2\right) \\
&\propto \exp\left(-\frac{1}{2}\left(\tau\left(\sum_{i=1}^n(x_i-\bar{x})^2 + n(\bar{x} -\mu)^2\right) + \tau_0(\mu-\mu_0)^2\right)\right) \\
&\propto \exp\left(-\frac{1}{2} \left(n\tau(\bar{x}-\mu)^2 + \tau_0(\mu-\mu_0)^2 \right)\right) \\
&= \exp\left(-\frac{1}{2}(n\tau + \tau_0)\left(\mu - \dfrac{n\tau \bar{x} + \tau_0\mu_0}{n\tau + \tau_0}\right)^2 + \frac{n\tau\tau_0}{n\tau+\tau_0}(\bar{x} - \mu_0)^2\right) \\
&\propto \exp\left(-\frac{1}{2}(n\tau + \tau_0)\left(\mu - \dfrac{n\tau \bar{x} + \tau_0\mu_0}{n\tau + \tau_0}\right)^2\right)
\end{align}

In the above derivation, we used the formula above for the sum of two quadratics and eliminated all constant factors not involving μ. The result is the kernel of a normal distribution, with mean \frac{n\tau \bar{x} + \tau_0\mu_0}{n\tau + \tau_0} and precision n\tau + \tau_0, i.e.

p(\mu|\mathbf{X}) \sim \mathcal{N}\left(\frac{n\tau \bar{x} + \tau_0\mu_0}{n\tau + \tau_0}, n\tau + \tau_0\right)

This can be written as a set of Bayesian update equations for the posterior parameters in terms of the prior parameters:

\begin{align}
\tau_0' &= \tau_0 + n\tau \\
\mu_0' &= \frac{n\tau \bar{x} + \tau_0\mu_0}{n\tau + \tau_0} \\
\bar{x} &= \frac{1}{n}\sum_{i=1}^n x_i
\end{align}

That is, to combine n data points with total precision of nτ (or equivalently, total variance of n2) and mean of values \bar{x}, derive a new total precision simply by adding the total precision of the data to the prior total precision, and form a new mean through a precision-weighted average, i.e. a weighted average of the data mean and the prior mean, each weighted by the associated total precision. This makes logical sense if the precision is thought of as indicating the certainty of the observations: In the distribution of the posterior mean, each of the input components is weighted by its certainty, and the certainty of this distribution is the sum of the individual certainties. (For the intuition of this, compare the expression "the whole is (or is not) greater than the sum of its parts". In addition, consider that the knowledge of the posterior comes from a combination of the knowledge of the prior and likelihood, so it makes sense that we are more certain of it than of either of its components.)

The above formula reveals why it is more convenient to do Bayesian analysis of conjugate priors for the normal distribution in terms of the precision. The posterior precision is simply the sum of the prior and likelihood precisions, and the posterior mean is computed through a precision-weighted average, as described above. The same formulas can be written in terms of variance by reciprocating all the precisions, yielding the more ugly formulas

\begin{align}
{\sigma^2_0}' &= \frac{1}{\frac{n}{\sigma^2} + \frac{1}{\sigma_0^2}} \\
\mu_0' &= \frac{\frac{n\bar{x}}{\sigma^2} + \frac{\mu_0}{\sigma_0^2}}{\frac{n}{\sigma^2} + \frac{1}{\sigma_0^2}} \\
\bar{x} &= \frac{1}{n}\sum_{i=1}^n x_i
\end{align}

With known mean[edit]

For a set of i.i.d. normally distributed data points X of size n where each individual point x follows x \sim \mathcal{N}(\mu, \sigma^2) with known mean μ, the conjugate prior of the variance has an inverse gamma distribution or a scaled inverse chi-squared distribution. The two are equivalent except for having different parameterizations. Although the inverse gamma is more commonly used, we use the scaled inverse chi-squared for the sake of convenience. The prior for σ2 is as follows:

p(\sigma^2|\nu_0,\sigma_0^2) = \frac{(\sigma_0^2\frac{\nu_0}{2})^{\frac{\nu_0}{2}}}{\Gamma\left(\frac{\nu_0}{2} \right)}~\frac{\exp\left[ \frac{-\nu_0 \sigma_0^2}{2 \sigma^2}\right]}{(\sigma^2)^{1+\frac{\nu_0}{2}}} \propto \frac{\exp\left[ \frac{-\nu_0 \sigma_0^2}{2 \sigma^2}\right]}{(\sigma^2)^{1+\frac{\nu_0}{2}}}

The likelihood function from above, written in terms of the variance, is:

\begin{align}
p(\mathbf{X}|\mu,\sigma^2) &= \left(\frac{1}{2\pi\sigma^2}\right)^{\frac{n}{2}} \exp\left[-\frac{1}{2\sigma^2} \sum_{i=1}^n (x_i-\mu)^2\right] \\
&= \left(\frac{1}{2\pi\sigma^2}\right)^{\frac{n}{2}} \exp\left[-\frac{S}{2\sigma^2}\right]
\end{align}

where

S = \sum_{i=1}^n (x_i-\mu)^2.

Then:

\begin{align}
p(\sigma^2|\mathbf{X}) &\propto p(\mathbf{X}|\sigma^2) p(\sigma^2) \\
&= \left(\frac{1}{2\pi\sigma^2}\right)^{\frac{n}{2}} \exp\left[-\frac{S}{2\sigma^2}\right] \frac{(\sigma_0^2\frac{\nu_0}{2})^{\frac{\nu_0}{2}}}{\Gamma\left(\frac{\nu_0}{2} \right)}~\frac{\exp\left[ \frac{-\nu_0 \sigma_0^2}{2 \sigma^2}\right]}{(\sigma^2)^{1+\frac{\nu_0}{2}}} \\
&\propto \left(\frac{1}{\sigma^2}\right)^{\frac{n}{2}} \frac{1}{(\sigma^2)^{1+\frac{\nu_0}{2}}} \exp\left[-\frac{S}{2\sigma^2} + \frac{-\nu_0 \sigma_0^2}{2 \sigma^2}\right] \\
&= \frac{1}{(\sigma^2)^{1+\frac{\nu_0+n}{2}}} \exp\left[-\frac{\nu_0 \sigma_0^2 + S}{2\sigma^2}\right]
\end{align}

The above is also a scaled inverse chi-squared distribution where

\begin{align}
\nu_0' &= \nu_0 + n \\
\nu_0'{\sigma_0^2}' &= \nu_0 \sigma_0^2 + \sum_{i=1}^n (x_i-\mu)^2
\end{align}

or equivalently

\begin{align}
\nu_0' &= \nu_0 + n \\
{\sigma_0^2}' &= \frac{\nu_0 \sigma_0^2 + \sum_{i=1}^n (x_i-\mu)^2}{\nu_0+n}
\end{align}

Reparameterizing in terms of an inverse gamma distribution, the result is:

\begin{align}
\alpha' &= \alpha + \frac{n}{2} \\
\beta' &= \beta + \frac{\sum_{i=1}^n (x_i-\mu)^2}{2}
\end{align}

With unknown mean and unknown variance[edit]

For a set of i.i.d. normally distributed data points X of size n where each individual point x follows x \sim \mathcal{N}(\mu, \sigma^2) with unknown mean μ and unknown variance σ2, a combined (multivariate) conjugate prior is placed over the mean and variance, consisting of a normal-inverse-gamma distribution. Logically, this originates as follows:

  1. From the analysis of the case with unknown mean but known variance, we see that the update equations involve sufficient statistics computed from the data consisting of the mean of the data points and the total variance of the data points, computed in turn from the known variance divided by the number of data points.
  2. From the analysis of the case with unknown variance but known mean, we see that the update equations involve sufficient statistics over the data consisting of the number of data points and sum of squared deviations.
  3. Keep in mind that the posterior update values serve as the prior distribution when further data is handled. Thus, we should logically think of our priors in terms of the sufficient statistics just described, with the same semantics kept in mind as much as possible.
  4. To handle the case where both mean and variance are unknown, we could place independent priors over the mean and variance, with fixed estimates of the average mean, total variance, number of data points used to compute the variance prior, and sum of squared deviations. Note however that in reality, the total variance of the mean depends on the unknown variance, and the sum of squared deviations that goes into the variance prior (appears to) depend on the unknown mean. In practice, the latter dependence is relatively unimportant: Shifting the actual mean shifts the generated points by an equal amount, and on average the squared deviations will remain the same. This is not the case, however, with the total variance of the mean: As the unknown variance increases, the total variance of the mean will increase proportionately, and we would like to capture this dependence.
  5. This suggests that we create a conditional prior of the mean on the unknown variance, with a hyperparameter specifying the mean of the pseudo-observations associated with the prior, and another parameter specifying the number of pseudo-observations. This number serves as a scaling parameter on the variance, making it possible to control the overall variance of the mean relative to the actual variance parameter. The prior for the variance also has two hyperparameters, one specifying the sum of squared deviations of the pseudo-observations associated with the prior, and another specifying once again the number of pseudo-observations. Note that each of the priors has a hyperparameter specifying the number of pseudo-observations, and in each case this controls the relative variance of that prior. These are given as two separate hyperparameters so that the variance (aka the confidence) of the two priors can be controlled separately.
  6. This leads immediately to the normal-inverse-gamma distribution, which is the product of the two distributions just defined, with conjugate priors used (an inverse gamma distribution over the variance, and a normal distribution over the mean, conditional on the variance) and with the same four parameters just defined.

The priors are normally defined as follows:

\begin{align}
p(\mu|\sigma^2; \mu_0, n_0) &\sim \mathcal{N}(\mu_0,\sigma^2/n_0) \\
p(\sigma^2; \nu_0,\sigma_0^2) &\sim I\chi^2(\nu_0,\sigma_0^2) = IG(\nu_0/2, \nu_0\sigma_0^2/2)
\end{align}


The update equations can be derived, and look as follows:

\begin{align}
\bar{x} &= \frac{1}{n}\sum_{i=1}^n x_i \\
\mu_0' &= \frac{n_0\mu_0 + n\bar{x}}{n_0 + n} \\
n_0' &= n_0 + n \\
\nu_0' &= \nu_0 + n \\
\nu_0'{\sigma_0^2}' &= \nu_0 \sigma_0^2 + \sum_{i=1}^n (x_i-\bar{x})^2 + \frac{n_0 n}{n_0 + n}(\mu_0 - \bar{x})^2
\end{align}

The respective numbers of pseudo-observations add the number of actual observations to them. The new mean hyperparameter is once again a weighted average, this time weighted by the relative numbers of observations. Finally, the update for \nu_0'{\sigma_0^2}' is similar to the case with known mean, but in this case the sum of squared deviations is taken with respect to the observed data mean rather than the true mean, and as a result a new "interaction term" needs to be added to take care of the additional error source stemming from the deviation between prior and data mean.

Occurrence[edit]

The occurrence of normal distribution in practical problems can be loosely classified into three categories:

  1. Exactly normal distributions;
  2. Approximately normal laws, for example when such approximation is justified by the central limit theorem; and
  3. Distributions modeled as normal – the normal distribution being the distribution with maximum entropy for a given mean and variance.

Exact normality[edit]

The ground state of a quantum harmonic oscillator has the Gaussian distribution.

Certain quantities in physics are distributed normally, as was first demonstrated by James Clerk Maxwell. Examples of such quantities are:

  • Velocities of the molecules in the ideal gas. More generally, velocities of the particles in any system in thermodynamic equilibrium will have normal distribution, due to the maximum entropy principle.
  • Probability density function of a ground state in a quantum harmonic oscillator.
  • The position of a particle that experiences diffusion. If initially the particle is located at a specific point (that is its probability distribution is the dirac delta function), then after time t its location is described by a normal distribution with variance t, which satisfies the diffusion equation /t f(x,t) = 1/2 2/x2 f(x,t). If the initial location is given by a certain density function g(x), then the density at time t is the convolution of g and the normal PDF.

Approximate normality[edit]

Approximately normal distributions occur in many situations, as explained by the central limit theorem. When the outcome is produced by many small effects acting additively and independently, its distribution will be close to normal. The normal approximation will not be valid if the effects act multiplicatively (instead of additively), or if there is a single external influence that has a considerably larger magnitude than the rest of the effects.

Assumed normality[edit]

Histogram of sepal widths for Iris versicolor from Fisher's Iris flower data set, with superimposed best-fitting normal distribution.

I can only recognize the occurrence of the normal curve – the Laplacian curve of errors – as a very abnormal phenomenon. It is roughly approximated to in certain distributions; for this reason, and on account for its beautiful simplicity, we may, perhaps, use it as a first approximation, particularly in theoretical investigations.

There are statistical methods to empirically test that assumption, see the above Normality tests section.

  • In biology, the logarithm of various variables tend to have a normal distribution, that is, they tend to have a log-normal distribution (after separation on male/female subpopulations), with examples including:
    • Measures of size of living tissue (length, height, skin area, weight);[40]
    • The length of inert appendages (hair, claws, nails, teeth) of biological specimens, in the direction of growth; presumably the thickness of tree bark also falls under this category;
    • Certain physiological measurements, such as blood pressure of adult humans.
  • In finance, in particular the Black–Scholes model, changes in the logarithm of exchange rates, price indices, and stock market indices are assumed normal (these variables behave like compound interest, not like simple interest, and so are multiplicative). Some mathematicians such as Benoît Mandelbrot have argued that log-Levy distributions, which possesses heavy tails would be a more appropriate model, in particular for the analysis for stock market crashes.
  • Measurement errors in physical experiments are often modeled by a normal distribution. This use of a normal distribution does not imply that one is assuming the measurement errors are normally distributed, rather using the normal distribution produces the most conservative predictions possible given only knowledge about the mean and variance of the errors.[41]
Fitted cumulative normal distribution to October rainfalls, see distribution fitting
  • In standardized testing, results can be made to have a normal distribution by either selecting the number and difficulty of questions (as in the IQ test) or transforming the raw test scores into "output" scores by fitting them to the normal distribution. For example, the SAT's traditional range of 200–800 is based on a normal distribution with a mean of 500 and a standard deviation of 100.
  • Many scores are derived from the normal distribution, including percentile ranks ("percentiles" or "quantiles"), normal curve equivalents, stanines, z-scores, and T-scores. Additionally, some behavioral statistical procedures assume that scores are normally distributed; for example, t-tests and ANOVAs. Bell curve grading assigns relative grades based on a normal distribution of scores.
  • In hydrology the distribution of long duration river discharge or rainfall, e.g. monthly and yearly totals, is often thought to be practically normal according to the central limit theorem.[42] The blue picture illustrates an example of fitting the normal distribution to ranked October rainfalls showing the 90% confidence belt based on the binomial distribution. The rainfall data are represented by plotting positions as part of the cumulative frequency analysis.

Generating values from normal distribution[edit]

The bean machine, a device invented by Francis Galton, can be called the first generator of normal random variables. This machine consists of a vertical board with interleaved rows of pins. Small balls are dropped from the top and then bounce randomly left or right as they hit the pins. The balls are collected into bins at the bottom and settle down into a pattern resembling the Gaussian curve.

In computer simulations, especially in applications of the Monte-Carlo method, it is often desirable to generate values that are normally distributed. The algorithms listed below all generate the standard normal deviates, since a N(μ, σ2
)
can be generated as X = μ + σZ, where Z is standard normal. All these algorithms rely on the availability of a random number generator U capable of producing uniform random variates.

  • The most straightforward method is based on the probability integral transform property: if U is distributed uniformly on (0,1), then Φ−1(U) will have the standard normal distribution. The drawback of this method is that it relies on calculation of the probit function Φ−1, which cannot be done analytically. Some approximate methods are described in Hart (1968) and in the erf article. Wichura[43] gives a fast algorithm for computing this function to 16 decimal places, which is used by R to compute random variates of the normal distribution.
  • An easy to program approximate approach, that relies on the central limit theorem, is as follows: generate 12 uniform U(0,1) deviates, add them all up, and subtract 6 – the resulting random variable will have approximately standard normal distribution. In truth, the distribution will be Irwin–Hall, which is a 12-section eleventh-order polynomial approximation to the normal distribution. This random deviate will have a limited range of (−6, 6).[44]
  • The Box–Muller method uses two independent random numbers U and V distributed uniformly on (0,1). Then the two random variables X and Y

    X = \sqrt{- 2 \ln U} \, \cos(2 \pi V) , \qquad
    Y = \sqrt{- 2 \ln U} \, \sin(2 \pi V) .
will both have the standard normal distribution, and will be independent. This formulation arises because for a bivariate normal random vector (X Y) the squared norm X2 + Y2 will have the chi-squared distribution with two degrees of freedom, which is an easily generated exponential random variable corresponding to the quantity −2ln(U) in these equations; and the angle is distributed uniformly around the circle, chosen by the random variable V.
  • Marsaglia polar method is a modification of the Box–Muller method algorithm, which does not require computation of functions sin() and cos(). In this method U and V are drawn from the uniform (−1,1) distribution, and then S = U2 + V2 is computed. If S is greater or equal to one then the method starts over, otherwise two quantities

    X = U\sqrt{\frac{-2\ln S}{S}}, \qquad  Y = V\sqrt{\frac{-2\ln S}{S}}
are returned. Again, X and Y will be independent and standard normally distributed.
  • The Ratio method[45] is a rejection method. The algorithm proceeds as follows:
    • Generate two independent uniform deviates U and V;
    • Compute X = 8/e (V − 0.5)/U;
    • Optional: if X2 ≤ 5 − 4e1/4U then accept X and terminate algorithm;
    • Optional: if X2 ≥ 4e−1.35/U + 1.4 then reject X and start over from step 1;
    • If X2 ≤ −4 lnU then accept X, otherwise start over the algorithm.
  • The ziggurat algorithm[46] is faster than the Box–Muller transform and still exact. In about 97% of all cases it uses only two random numbers, one random integer and one random uniform, one multiplication and an if-test. Only in 3% of the cases, where the combination of those two falls outside the "core of the ziggurat" (a kind of rejection sampling using logarithms), do exponentials and more uniform random numbers have to be employed.
  • There is also some investigation[47] into the connection between the fast Hadamard transform and the normal distribution, since the transform employs just addition and subtraction and by the central limit theorem random numbers from almost any distribution will be transformed into the normal distribution. In this regard a series of Hadamard transforms can be combined with random permutations to turn arbitrary data sets into a normally distributed data.

Numerical approximations for the normal CDF[edit]

The standard normal CDF is widely used in scientific and statistical computing. The values Φ(x) may be approximated very accurately by a variety of methods, such as numerical integration, Taylor series, asymptotic series and continued fractions. Different approximations are used depending on the desired level of accuracy.

  • Zelen & Severo (1964) give the approximation for Φ(x) for x > 0 with the absolute error |ε(x)| < 7.5·10−8 (algorithm 26.2.17):
    
    \Phi(x) = 1 - \phi(x)\left(b_1t + b_2t^2 + b_3t^3 + b_4t^4 + b_5t^5\right) + \varepsilon(x), \qquad t = \frac{1}{1+b_0x},
    where ϕ(x) is the standard normal PDF, and b0 = 0.2316419, b1 = 0.319381530, b2 = −0.356563782, b3 = 1.781477937, b4 = −1.821255978, b5 = 1.330274429.
  • Hart (1968) lists almost a hundred of rational function approximations for the erfc() function. His algorithms vary in the degree of complexity and the resulting precision, with maximum absolute precision of 24 digits. An algorithm by West (2009) combines Hart's algorithm 5666 with a continued fraction approximation in the tail to provide a fast computation algorithm with a 16-digit precision.
  • Cody (1969) after recalling Hart68 solution is not suited for erf, gives a solution for both erf and erfc, with maximal relative error bound, via Rational Chebyshev Approximation.
  • Marsaglia (2004) suggested a simple algorithm[nb 1] based on the Taylor series expansion
    
    \Phi(x) = \frac12 + \phi(x)\left( x + \frac{x^3}{3} + \frac{x^5}{3\cdot5} + \frac{x^7}{3\cdot5\cdot7} + \frac{x^9}{3\cdot5\cdot7\cdot9} + \cdots \right)
    for calculating Φ(x) with arbitrary precision. The drawback of this algorithm is comparatively slow calculation time (for example it takes over 300 iterations to calculate the function with 16 digits of precision when x = 10).
  • The GNU Scientific Library calculates values of the standard normal CDF using Hart's algorithms and approximations with Chebyshev polynomials.

History[edit]

Development[edit]

Some authors[48][49] attribute the credit for the discovery of the normal distribution to de Moivre, who in 1738[nb 2] published in the second edition of his "The Doctrine of Chances" the study of the coefficients in the binomial expansion of (a + b)n. De Moivre proved that the middle term in this expansion has the approximate magnitude of \scriptstyle 2/\sqrt{2\pi n}, and that "If m or ½n be a Quantity infinitely great, then the Logarithm of the Ratio, which a Term distant from the middle by the Interval , has to the middle Term, is \scriptstyle -\frac{2\ell\ell}{n}."[50] Although this theorem can be interpreted as the first obscure expression for the normal probability law, Stigler points out that de Moivre himself did not interpret his results as anything more than the approximate rule for the binomial coefficients, and in particular de Moivre lacked the concept of the probability density function.[51]

Carl Friedrich Gauss discovered the normal distribution in 1809 as a way to rationalize the method of least squares.

In 1809 Gauss published his monograph "Theoria motus corporum coelestium in sectionibus conicis solem ambientium" where among other things he introduces several important statistical concepts, such as the method of least squares, the method of maximum likelihood, and the normal distribution. Gauss used M, M, M′′, … to denote the measurements of some unknown quantity V, and sought the "most probable" estimator: the one that maximizes the probability φ(M−V) · φ(M′−V) · φ(M′′−V) · … of obtaining the observed experimental results. In his notation φΔ is the probability law of the measurement errors of magnitude Δ. Not knowing what the function φ is, Gauss requires that his method should reduce to the well-known answer: the arithmetic mean of the measured values.[nb 3] Starting from these principles, Gauss demonstrates that the only law that rationalizes the choice of arithmetic mean as an estimator of the location parameter, is the normal law of errors:[52]


    \varphi\mathit{\Delta} = \frac{h}{\surd\pi}\, e^{-\mathrm{hh}\Delta\Delta},

where h is "the measure of the precision of the observations". Using this normal law as a generic model for errors in the experiments, Gauss formulates what is now known as the non-linear weighted least squares (NWLS) method.[53]

Marquis de Laplace proved the central limit theorem in 1810, consolidating the importance of the normal distribution in statistics.

Although Gauss was the first to suggest the normal distribution law, Laplace made significant contributions.[nb 4] It was Laplace who first posed the problem of aggregating several observations in 1774,[54] although his own solution led to the Laplacian distribution. It was Laplace who first calculated the value of the integral et ²dt = π in 1782, providing the normalization constant for the normal distribution.[55] Finally, it was Laplace who in 1810 proved and presented to the Academy the fundamental central limit theorem, which emphasized the theoretical importance of the normal distribution.[56]

It is of interest to note that in 1809 an American mathematician Adrain published two derivations of the normal probability law, simultaneously and independently from Gauss.[57] His works remained largely unnoticed by the scientific community, until in 1871 they were "rediscovered" by Abbe.[58]

In the middle of the 19th century Maxwell demonstrated that the normal distribution is not just a convenient mathematical tool, but may also occur in natural phenomena:[59] "The number of particles whose velocity, resolved in a certain direction, lies between x and x + dx is


    \mathrm{N}\; \frac{1}{\alpha\;\sqrt\pi}\; e^{-\frac{x^2}{\alpha^2}}dx

Naming[edit]

Since its introduction, the normal distribution has been known by many different names: the law of error, the law of facility of errors, Laplace's second law, Gaussian law, etc. Gauss himself apparently coined the term with reference to the "normal equations" involved in its applications, with normal having its technical meaning of orthogonal rather than "usual".[60] However, by the end of the 19th century some authors[nb 5] had started using the name normal distribution, where the word "normal" was used as an adjective – the term now being seen as a reflection of the fact that this distribution was seen as typical, common – and thus "normal". Peirce (one of those authors) once defined "normal" thus: "...the 'normal' is not the average (or any other kind of mean) of what actually occurs, but of what would, in the long run, occur under certain circumstances."[61] Around the turn of the 20th century Pearson popularized the term normal as a designation for this distribution.[62]

Many years ago I called the Laplace–Gaussian curve the normal curve, which name, while it avoids an international question of priority, has the disadvantage of leading people to believe that all other distributions of frequency are in one sense or another 'abnormal'.

Also, it was Pearson who first wrote the distribution in terms of the standard deviation σ as in modern notation. Soon after this, in year 1915, Fisher added the location parameter to the formula for normal distribution, expressing it in the way it is written nowadays:

 df = \frac{1}{\sigma\sqrt{2\pi}}e^{-\frac{(x-m)^2}{2\sigma^2}}dx

The term "standard normal", which denotes the normal distribution with zero mean and unit variance came into general use around the 1950s, appearing in the popular textbooks by P.G. Hoel (1947) "Introduction to mathematical statistics" and A.M. Mood (1950) "Introduction to the theory of statistics".[63]

When the name is used, the "Gaussian distribution" was named after Carl Friedrich Gauss, who introduced the distribution in 1809 as a way of rationalizing the method of least squares as outlined above. Among English speakers, both "normal distribution" and "Gaussian distribution" are in common use, with different terms preferred by different communities.

See also[edit]

Notes[edit]

  1. ^ For example, this algorithm is given in the article Bc programming language.
  2. ^ De Moivre first published his findings in 1733, in a pamphlet "Approximatio ad Summam Terminorum Binomii (a + b)n in Seriem Expansi" that was designated for private circulation only. But it was not until the year 1738 that he made his results publicly available. The original pamphlet was reprinted several times, see for example Walker (1985).
  3. ^ "It has been customary certainly to regard as an axiom the hypothesis that if any quantity has been determined by several direct observations, made under the same circumstances and with equal care, the arithmetical mean of the observed values affords the most probable value, if not rigorously, yet very nearly at least, so that it is always most safe to adhere to it." — Gauss (1809, section 177)
  4. ^ "My custom of terming the curve the Gauss–Laplacian or normal curve saves us from proportioning the merit of discovery between the two great astronomer mathematicians." quote from Pearson (1905, p. 189)
  5. ^ Besides those specifically referenced here, such use is encountered in the works of Peirce, Galton (Galton (1889, chapter V)) and Lexis (Lexis (1878), Rohrbasser & Véron (2003)) c. 1875.[citation needed]

Citations[edit]

  1. ^ Normal Distribution, Gale Encyclopedia of Psychology
  2. ^ Casella & Berger (2001, p. 102)
  3. ^ Cover, Thomas M.; Thomas, Joy A. (2006). Elements of Information Theory. John Wiley and Sons. p. 254. 
  4. ^ Park, Sung Y.; Bera, Anil K. (2009). "Maximum Entropy Autoregressive Conditional Heteroskedasticity Model". Journal of Econometrics (Elsevier) 150 (2): 219–230. doi:10.1016/j.jeconom.2008.12.014. Retrieved 2011-06-02. 
  5. ^ For the proof see Gaussian integral
  6. ^ Stigler (1982)
  7. ^ Halperin, Hartley & Hoel (1965, item 7)
  8. ^ McPherson (1990, p. 110)
  9. ^ Bernardo & Smith (2000, p. 121)
  10. ^ a b c Patel & Read (1996, [2.1.4])
  11. ^ Fan (1991, p. 1258)
  12. ^ Patel & Read (1996, [2.1.8])
  13. ^ Bryc (1995, p. 23)
  14. ^ Bryc (1995, p. 24)
  15. ^ Scott, Clayton; Nowak, Robert (August 7, 2003). "The Q-function". Connexions. 
  16. ^ Barak, Ohad (April 6, 2006). "Q Function and Error Function". Tel Aviv University. 
  17. ^ Weisstein, Eric W., "Normal Distribution Function", MathWorld.
  18. ^ WolframAlpha.com
  19. ^ part 1, part 2
  20. ^ Normal Approximation to Poisson(λ) Distribution, http://www.stat.ucla.edu/
  21. ^ Bryc (1995, p. 27)
  22. ^ Patel & Read (1996, [2.3.6])
  23. ^ Galambos & Simonelli (2004, Theorem 3.5)
  24. ^ a b Bryc (1995, p. 35)
  25. ^ a b Lukacs & King (1954)
  26. ^ Quine, M.P. (1993) "On three characterisations of the normal distribution", Probability and Mathematical Statistics, 14 (2), 257-263
  27. ^ UIUC, Lecture 21. The Multivariate Normal Distribution, 21.6:"Individually Gaussian Versus Jointly Gaussian".
  28. ^ Edward L. Melnick and Aaron Tenenbein, "Misspecifications of the Normal Distribution", The American Statistician, volume 36, number 4 November 1982, pages 372–373
  29. ^ http://www.allisons.org/ll/MML/KL/Normal/
  30. ^ Jordan, Michael I. (February 8, 2010). "Stat260: Bayesian Modeling and Inference: The Conjugate Prior for the Normal Distribution". 
  31. ^ Cover & Thomas (2006, p. 254)
  32. ^ Amari & Nagaoka (2000)
  33. ^ Normal Product Distribution, Mathworld
  34. ^ Eugene Lukacs (1942). "A Characterization of the Normal Distribution". The Annals of Mathematical Statistics 13 (1): 91–93. doi:10.1214/aoms/1177731647. 
  35. ^ D. Basu and R. G. Laha (1954). "On Some Characterizations of the Normal Distribution". Sankhyā 13 (4): 359–362. 
  36. ^ Lehmann, E. L. (1997). Testing Statistical Hypotheses (2nd ed.). Springer. p. 199. ISBN 0-387-94919-4. 
  37. ^ a b Krishnamoorthy (2006, p. 127)
  38. ^ Krishnamoorthy (2006, p. 130)
  39. ^ Krishnamoorthy (2006, p. 133)
  40. ^ Huxley (1932)
  41. ^ Jaynes, Edwin T. (2003). Probability Theory: The Logic of Science. Cambridge University Press. pp. 592–593. 
  42. ^ Oosterbaan, Roland J. (1994). "Chapter 6: Frequency and Regression Analysis of Hydrologic Data". In Ritzema, Henk P. Drainage Principles and Applications, Publication 16 (second revised ed.). Wageningen, The Netherlands: International Institute for Land Reclamation and Improvement (ILRI). pp. 175–224. ISBN 90-70754-33-9. 
  43. ^ Wichura, Michael J. (1988). "Algorithm AS241: The Percentage Points of the Normal Distribution". Applied Statistics (Blackwell Publishing) 37 (3): 477–484. doi:10.2307/2347330. JSTOR 2347330. 
  44. ^ Johnson, Kotz & Balakrishnan (1995, Equation (26.48))
  45. ^ Kinderman & Monahan (1977)
  46. ^ Marsaglia & Tsang (2000)
  47. ^ Wallace (1996)
  48. ^ Johnson, Kotz & Balakrishnan (1994, p. 85)
  49. ^ Le Cam & Lo Yang (2000, p. 74)
  50. ^ De Moivre, Abraham (1733), Corollary I – see Walker (1985, p. 77)
  51. ^ Stigler (1986, p. 76)
  52. ^ Gauss (1809, section 177)
  53. ^ Gauss (1809, section 179)
  54. ^ Laplace (1774, Problem III)
  55. ^ Pearson (1905, p. 189)
  56. ^ Stigler (1986, p. 144)
  57. ^ Stigler (1978, p. 243)
  58. ^ Stigler (1978, p. 244)
  59. ^ Maxwell (1860, p. 23)
  60. ^ Jaynes, Edwin J.; Probability Theory: The Logic of Science, Ch 7
  61. ^ Peirce, Charles S. (c. 1909 MS), Collected Papers v. 6, paragraph 327
  62. ^ Kruskal & Stigler (1997)
  63. ^ "Earliest uses… (entry STANDARD NORMAL CURVE)". 

References[edit]

External links[edit]