In probability theory and statistics, a multivariate normal distribution, also sometimes called a multivariate Gaussian distribution, is a specific probability distribution, which can be thought of as a generalization to higher dimensions of the one-dimensional normal distribution (also called a Gaussian distribution).
General case
A
random vector follows a multivariate normal distribution if it satisfies the following equivalent conditions:
- there is a vector and a symmetric, positive semi-definite matrix such that the characteristic function of is
\phi_X(u;\mu,\Sigma)
=
\exp
\left(
i \mu^\top u - \frac{1}{2} u^\top \Sigma u
\right)
The following is not quite equivalent to the conditions above, since it fails to allow for a singular matrix as the variance:
f_X(x_1, \dots, x_N)
=
\frac
{1}
{(2\pi)^{N/2} \left|\Sigma\right|^{1/2}}
\exp
\left(
-\frac{1}{2}
( x - \mu)^\top \Sigma^{-1} (x - \mu)
\right)
where is the determinant of .
Note how the equation above reduces to that of the univariate normal distribution if is a scalar (i.e., a real number).
The vector in these conditions is the expected value of and the matrix is the covariance matrix of the components .
It is important to realize that the covariance matrix must be allowed to be singular.
That case arises frequently in statistics; for example, in the distribution of the vector of residuals in ordinary linear regression problems.
Note also that the are in general not independent; they can be seen as the result of applying the linear transformation to a collection of independent Gaussian variables .
The multivariate normal can be written in the following notation:
-
or to make it explicitly known is N-dimensional
-
Cumulative distribution function
The cumulative distribution function (cdf) is defined as the probability that all values in a random vector are less than or equal to the corresponding values in vector . Though there is no closed form for , there are a number of algorithms that estimate it numerically. For example, see MVNDST under
* (includes FORTRAN code) or
* (includes MATLAB code).
A counterexample
The fact that two random variables X and Y are normally distributed does not imply that the pair (X, Y) has a bivariate normal distribution. A simple example is one in which Y = X if |X| > 1 and Y = −X if |X| < 1.
If X and Y are normally distributed and independent, then they are "jointly normally distributed", i.e., the pair (X, Y) does have a bivariate normal distribution. There are of course also many bivariate normal distributions in which the components are correlated.
Bivariate case
In the 2-dimensional nonsingular case, the
probability density function (with mean (0,0)) is
f(x,y)
=
\frac{1}{2 \pi \sigma_x \sigma_y \sqrt{1-\rho^2}}
\exp
\left(
-\frac{1}{2 (1-\rho^2)}
\left(
\frac{x^2}{\sigma_x^2} +
\frac{y^2}{\sigma_y^2} -
\frac{2 \rho x y}{ (\sigma_x \sigma_y)}
\right)
\right)
where is the correlation between and .
Linear transformation
If is a linear transformation of where is an matrix then has a multivariate normal distribution with expected value and variance (i.e., .
Corollary: any subset of the has a marginal distribution that is also multivariate normal.
To see this consider the following example: to extract the subset , use
B
=
\begin{bmatrix}
1 & 0 & 0 & 0 & 0 & \ldots & 0 \\
0 & 1 & 0 & 0 & 0 & \ldots & 0 \\
0 & 0 & 0 & 1 & 0 & \ldots & 0
\end{bmatrix}
which extracts the desired elements directly.
Correlations and independence
In general, random variables may be uncorrelated but highly dependent. But if a random vector has a multivariate normal distribution then any two or more of its components that are uncorrelated are independent. This implies that any two or more of its components that are pairwise independent are independent.
But it is not true that two random variables that are (separately, marginally) normally distributed and uncorrelated are independent. Two random variables that are normally distributed may fail to be jointly normally distributed, i.e., the vector whose components they are may fail to have a multivariate normal distribution. For an example of two normally distributed random variables that are uncorrelated but not independent, see normally distributed and uncorrelated does not imply independent.
Higher moments
The
-order moments of
are defined by
\mu _{1,...,N}(X)\equiv \mu _{r_{1},...,r_{N}}(X)\equiv E\left[
\prod\limits_{j=1}^{N}x^{r_{j}}\right]
where
The central -order moments are given as follows
(a) If is odd, .
(b) If is even with , then
\mu _{1,...,2\lambda }(X-\mu )=\sum \left( \sigma _{ij}\sigma _{kl}...\sigma _{xz}\right)
where the sum is taken over all permutations of
giving
terms in the sum each being the product of
covariances
In particular, the 4-order moments are
-
-
-
-
-
Conditional distributions
Then if and are partitioned as follows
\mu
=
\begin{bmatrix}
\mu_1 \\
\mu_2
\end{bmatrix}
\quad with sizes
\Sigma
=
\begin{bmatrix}
\Sigma_{11} & \Sigma_{12} \\
\Sigma_{21} & \Sigma_{22}
\end{bmatrix}
\quad with sizes
then the distribution of conditional on is multivariate normal where
\bar{\mu}
=
\mu_1 + \Sigma_{12} \Sigma_{22}^{-1}
\left(
a - \mu_2
\right)
and covariance matrix
\overline{\Sigma}
=
\Sigma_{11} - \Sigma_{12} \Sigma_{22}^{-1} \Sigma_{21}.
This matrix is the Schur complement of in .
Note that knowing the value of to be alters the variance; perhaps more surprisingly, the mean is shifted by ; compare this with the situation of not knowing the value of , in which case would have distribution
.
The matrix is known as the matrix of regression coefficients.
Fisher information matrix
The
Fisher information matrix (FIM) for a normal distribution takes a special formulation.
The
element of the FIM for
is
\mathcal{I}_{m,n}
=
\frac{\partial \mu}{\partial \theta_m}
\Sigma^{-1}
\frac{\partial \mu^\top}{\partial \theta_n}
+
\frac{1}{2}
\mathrm{tr}
\left(
\Sigma^{-1}
\frac{\partial \Sigma}{\partial \theta_m}
\Sigma^{-1}
\frac{\partial \Sigma}{\partial \theta_n}
\right)
where
\frac{\partial \mu}{\partial \theta_m}
=
\begin{bmatrix}
\frac{\partial \mu_1}{\partial \theta_m} &
\frac{\partial \mu_2}{\partial \theta_m} &
\cdots &
\frac{\partial \mu_N}{\partial \theta_m} &
\end{bmatrix}
\frac{\partial \mu^\top}{\partial \theta_m}
=
\left(
\frac{\partial \mu}{\partial \theta_m}
\right)^\top
=
\begin{bmatrix}
\frac{\partial \mu_1}{\partial \theta_m} \\ \\
\frac{\partial \mu_2}{\partial \theta_m} \\ \\
\vdots \\ \\
\frac{\partial \mu_N}{\partial \theta_m} \\ \\
\end{bmatrix}
\frac{\partial \Sigma}{\partial \theta_m}
=
\begin{bmatrix}
\frac{\partial \Sigma_{1,1}}{\partial \theta_m} &
\frac{\partial \Sigma_{1,2}}{\partial \theta_m} &
\cdots &
\frac{\partial \Sigma_{1,N}}{\partial \theta_m} \\ \\
\frac{\partial \Sigma_{2,1}}{\partial \theta_m} &
\frac{\partial \Sigma_{2,2}}{\partial \theta_m} &
\cdots &
\frac{\partial \Sigma_{2,N}}{\partial \theta_m} \\ \\
\vdots & \vdots & \ddots & \vdots \\ \\
\frac{\partial \Sigma_{N,1}}{\partial \theta_m} &
\frac{\partial \Sigma_{N,2}}{\partial \theta_m} &
\cdots &
\frac{\partial \Sigma_{N,N}}{\partial \theta_m}
\end{bmatrix}
- is the trace function
Kullback-Leibler divergence
The
Kullback-Leibler divergence from
to
is:
KL(N0, N1) = { 1 \over 2 } \left( \log \left( { \det \Sigma_1 \over \det \Sigma_0 } \right) + \mathrm{tr} \left( \Sigma_1^{-1} \Sigma_0 \right) + \left( \mu_1 - \mu_0\right)^\top \Sigma_1^{-1} ( \mu_1 - \mu_0 ) - N\right).
Estimation of parameters
The derivation of the maximum-likelihood estimator of the covariance matrix of a multivariate normal distribution is perhaps surprisingly subtle and elegant. See estimation of covariance matrices.
In short, the pdf is
-
and the ML estimator of the covariance matrix is
-
which is simply the sample covariance matrix. This is a biased estimator whose expectation is
-
An unbiased sample covariance is
-
Multivariate normality tests
Multivariate normality tests check a given set of data for similarity to the multivariate normal distribution. The null hypothesis is that the data set is similar to the normal distribution, therefore a sufficiently small p-value indicates non-normal data. Multivariate normality tests include the Cox-Small test
and Smith and Jain's adaptation of the Friedman-Rafsky test
.
Drawing values from the distribution
A widely used method for drawing a random vector from the -dimensional multivariate normal distribution with mean vector and covariance matrix (required to be symmetric and positive definite) works as follows:
- Compute the Cholesky decomposition (matrix square root) of , that is, find the unique lower triangular matrix such that .
- Let be a vector whose components are independent standard normal variates (which can be generated, for example, by using the Box-Muller transform).
- Let be .
References
Continuous distributions
loi normale multidimensionnelle | Многомерное нормальное распределение | Multivariat normalfördelning