Variance

In probability theory and statistics, variance is a measure of dispersion, meaning it is a measure of how far a set of numbers are spread out from their average value.

Uses your system voice; voice and rate in settings.

≈ 27 min read

Cite, export and learn8 citation formats · 8 exports · lesson and quiz

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In probability theory and statistics, variance is a measure of dispersion, meaning it is a measure of how far a set of numbers are spread out from their average value. It is defined as the expected value of the squared deviation from the mean of a random variable. The standard deviation is the square root of the variance.

Technically, it is the second central moment of a distribution, and the covariance of the random variable with itself, and it is often represented by , , , , or . An advantage of variance as a measure of dispersion is that it is more amenable to algebraic manipulation than other measures of dispersion such as the expected absolute deviation; for example, the variance of a sum of uncorrelated random variables is equal to the sum of their variances.

A disadvantage of the variance for practical applications is that, unlike the standard deviation, its units differ from the random variable, which is why the standard deviation is more commonly reported as a measure of dispersion once the calculation is finished. Another disadvantage is that the variance is not finite for many distributions.

There are two distinct concepts that are both called "variance". One, as discussed above, is part of a theoretical probability distribution and is defined by an equation. The other variance is a characteristic of a set of observations.

When variance is calculated from observations, those observations are typically measured from a real-world system. If all possible observations of the system are present, then the calculated variance is called the population variance. Normally, however, only a subset is available, and the variance calculated from this is called the sample variance.

The variance calculated from a sample is considered an estimate of the full population variance. There are multiple ways to estimate the population variance on the basis of the sample variance, as discussed in the section below. The two kinds of variance are closely related.

To see how, consider that a theoretical probability distribution can be used as a generator of hypothetical observations. If an infinite number of observations are generated using a distribution, then the sample variance calculated from that infinite set will match the value calculated using the distribution's equation for variance.

Variance has a central role in statistics, where some ideas that use it include descriptive statistics, statistical inference, hypothesis testing, goodness of fit, and Monte Carlo sampling. \operatorname{Var}(X) = \operatorname{E}\left[(X - \mu)^2 \right]. This definition encompasses random variables that are generated by processes that are discrete, continuous, neither, or mixed.

The variance can also be thought of as the covariance of a random variable with itself: \operatorname{Var}(X) = \operatorname{Cov}(X, X). The variance is also equivalent to the second cumulant of a probability distribution that generates . The variance is typically designated as , or sometimes as V(X) or , or symbolically as or simply \sigma^2 (pronounced "sigma squared").

The expression for the variance can be expanded as follows: \begin{align} \operatorname{Var}(X) &= \operatorname{E}\left[{\left(X - \operatorname{E}[X]\right)}^2\right] \\[4pt] &= \operatorname{E}\left[X^2 - 2 X \operatorname{E}[X] + \operatorname{E}[X]^2\right] \\[4pt] &= \operatorname{E}\left[X^2\right] - 2 \operatorname{E}[X] \operatorname{E}[X] + \operatorname{E}[X]^2 \\[4pt] &= \operatorname{E}\left[X^2\right] - 2\operatorname{E}[X]^2 + \operatorname{E}[X]^2 \\[4pt] &= \operatorname{E}\left[X^2\right] - \operatorname{E}[X]^2 \end{align} In other words, the variance of is equal to the mean of the square of minus the square of the mean of . This equation should not be used for computations using floating-point arithmetic, because it suffers from catastrophic cancellation if the two components of the equation are similar in magnitude.

For other numerically stable alternatives, see Algorithms for calculating variance. \operatorname{Var}(X) = \sum_{i=1}^n p_i \cdot {\left(x_i - \mu\right)}^2, where \mu is the expected value. That is, \mu = \sum_{i=1}^n p_i x_i. (When such a discrete weighted variance is specified by weights whose sum is not 1, then one divides by the sum of the weights.)

The variance of a collection of n equally likely values can be written as \operatorname{Var}(X) = \frac{1}{n} \sum_{i=1}^n (x_i - \mu)^2 , where \mu is the average value. That is, \mu = \frac{1}{n}\sum_{i=1}^n x_i.

The variance of a set of n equally likely values can be equivalently expressed, without directly referring to the mean, in terms of squared deviations of all pairwise squared distances of points from each other: \operatorname{Var}(X) = \frac{1}{n^2} \sum_{i=1}^n \sum_{j=1}^n \frac{1}{2} {\left(x_i - x_j\right)}^2 = \frac{1}{n^2} \sum_i \sum_{j>i} {\left(x_i - x_j\right)}^2. \begin{align} \operatorname{Var}(X) = \sigma^2 &= \int_{\R} {\left(x - \mu\right)}^2 f(x) \, dx \\[4pt] &= \int_{\R} x^2 f(x)\,dx -2\mu\int_{\R} xf(x)\,dx + \mu^2\int_{\R} f(x)\,dx \\[4pt] &= \int_{\R} x^2 \,dF(x) - 2 \mu \int_{\R} x \,dF(x) + \mu^2 \int_{\R} \,dF(x) \\[4pt] &= \int_{\R} x^2 \,dF(x) - 2 \mu \cdot \mu + \mu^2 \cdot 1 \\[4pt] &= \int_{\R} x^2 \,dF(x) - \mu^2, \end{align} or equivalently, \operatorname{Var}(X) = \int_{\R} x^2 f(x) \,dx - \mu^2 , where \mu is the expected value of X given by \mu = \int_{\R} x f(x) \, dx = \int_{\R} x \, dF(x). In these formulas, the integrals with respect to dx and dF(x) are Lebesgue and Lebesgue–Stieltjes integrals, respectively. If the function x^2f(x) is Riemann-integrable on every finite interval [a,b]\subset\R, then \operatorname{Var}(X) = \int^{+\infty}_{-\infty} x^2 f(x) \, dx - \mu^2, where the integral is an improper Riemann integral. f(x) = \lambda e^{-\lambda x} on the interval .

Its mean can be shown to be \operatorname{E}[X] = \int_0^\infty x \lambda e^{-\lambda x} \, dx = \frac{1}{\lambda}. Using integration by parts and making use of the expected value already calculated, we have: \begin{align} \operatorname{E}\left[X^2\right] &= \int_0^\infty x^2 \lambda e^{-\lambda x} \, dx \\ &= {\left[ -x^2 e^{-\lambda x} \right]}_0^\infty + \int_0^\infty 2 x e^{-\lambda x} \,dx \\ &= 0 + \frac{2}{\lambda}\operatorname{E}[X] \\ &= \frac{2}{\lambda^2}. \end{align} Thus, the variance of is given by \operatorname{Var}(X) = \operatorname{E}\left[X^2\right] - \operatorname{E}[X]^2 = \frac{2}{\lambda^2} - \left(\frac{1}{\lambda}\right)^2 = \frac{1}{\lambda^2}.

A fair six-sided die can be modeled as a discrete random variable, , with outcomes 1 through 6, each with equal probability 1/6. The expected value of is (1 + 2 + 3 + 4 + 5 + 6)/6 = 7/2.

Therefore, the variance of is \begin{align} \operatorname{Var}(X) &= \sum_{i=1}^6 \frac{1}{6}\left(i - \frac{7}{2}\right)^2 \\[5pt] &= \frac{1}{6}\left((-5/2)^2 + (-3/2)^2 + (-1/2)^2 + (1/2)^2 + (3/2)^2 + (5/2)^2\right) \\[5pt] &= \frac{35}{12} \approx 2.92. \end{align} The general formula for the variance of the outcome, , of an die is \begin{align} \operatorname{Var}(X) &= \operatorname{E}\left(X^2\right) - (\operatorname{E}(X))^2 \\[5pt] &= \frac{1}{n}\sum_{i=1}^n i^2 - \left(\frac{1}{n}\sum_{i=1}^n i\right)^2 \\[5pt] &= \frac{(n + 1)(2n + 1)}{6} - \left(\frac{n + 1}{2}\right)^2 \\[4pt] &= \frac{n^2 - 1}{12}. \end{align} \operatorname{Var}(X)\ge 0. The variance of a constant is zero. \operatorname{Var}(a) = 0.

Conversely, if the variance of a random variable is 0, then it is almost surely a constant. That is, it always has the same value: \operatorname{Var}(X)= 0 \iff \exists a : P(X=a) = 1. \operatorname{Var}[X] = \operatorname{E}(\operatorname{Var}[X\mid Y]) + \operatorname{Var}(\operatorname{E}[X\mid Y]). The conditional expectation \operatorname E(X\mid Y) of X given Y , and the conditional variance \operatorname{Var}(X\mid Y) may be understood as follows.

Given any particular value y of the random variable Y, there is a conditional expectation \operatorname E(X\mid Y=y) given the event Y = y. This quantity depends on the particular value y; it is a function g(y) = \operatorname E(X\mid Y=y) . That same function evaluated at the random variable Y is the conditional expectation . In particular, if Y is a discrete random variable assuming possible values y_1, y_2, y_3 \ldots with corresponding probabilities p_1, p_2, p_3 \ldots, , then in the formula for total variance, the first term on the right-hand side becomes \operatorname{E}(\operatorname{Var}[X \mid Y]) = \sum_i p_i \sigma^2_i, where \sigma^2_i = \operatorname{Var}[X \mid Y = y_i] .

Similarly, the second term on the right-hand side becomes \operatorname{Var}(\operatorname{E}[X \mid Y]) = \sum_i p_i \mu_i^2 - \left(\sum_i p_i \mu_i\right)^2 = \sum_i p_i \mu_i^2 - \mu^2, where and . Thus the total variance is given by \operatorname{Var}[X] = \sum_i p_i \sigma^2_i + \left( \sum_i p_i \mu_i^2 - \mu^2 \right).

A similar formula is applied in analysis of variance, where the corresponding formula is \mathit{MS}_\text{total} = \mathit{MS}_\text{between} + \mathit{MS}_\text{within}; here \mathit{MS} refers to the Mean of the Squares. In linear regression analysis the corresponding formula is \mathit{MS}_\text{total} = \mathit{MS}_\text{regression} + \mathit{MS}_\text{residual}.

This can also be derived from the additivity of variances, since the total (observed) score is the sum of the predicted score and the error score, where the latter two are uncorrelated. Similar decompositions are possible for the sum of squared deviations (sum of squares, \mathit{SS} ): \mathit{SS}_\text{total} = \mathit{SS}_\text{between} + \mathit{SS}_\text{within}, \mathit{SS}_\text{total} = \mathit{SS}_\text{regression} + \mathit{SS}_\text{residual}.

2\int_0^\infty u(1 - F(u))\,du - {\left[\int_0^\infty (1 - F(u))\,du\right]}^2. This expression can be used to calculate the variance in situations where the CDF, but not the density, can be conveniently expressed.

The second moment of a random variable attains the minimum value when taken around the first moment (i.e., mean) of the random variable, i.e. . Conversely, if a continuous function \varphi satisfies \mathrm{argmin}_m\,\mathrm{E}(\varphi(X - m)) = \mathrm{E}(X) for all random variables , then it is necessarily of the form , where . This also holds in the multidimensional case. \operatorname{Var}(X+a)=\operatorname{Var}(X). If all values are scaled by a constant, the variance is scaled by the square of that constant: \operatorname{Var}(aX)=a^2\operatorname{Var}(X). The variance of a sum of two random variables is given by \begin{align} \operatorname{Var}(aX + bY) &= a^2\operatorname{Var}(X) + b^2\operatorname{Var}(Y) + 2ab\, \operatorname{Cov}(X,Y) \\[1ex] \operatorname{Var}(aX - bY) &= a^2\operatorname{Var}(X) + b^2\operatorname{Var}(Y) - 2ab\, \operatorname{Cov}(X,Y) \end{align} where \operatorname{Cov}(X,Y) is the covariance. \operatorname{Var}\left(\sum_{i=1}^N X_i\right) = \sum_{i,j=1}^N\operatorname{Cov}(X_i,X_j) = \sum_{i=1}^N\operatorname{Var}(X_i) + \sum_{i,j=1,i\ne j}^N\operatorname{Cov}(X_i,X_j), see also general Bienaymé's identity.

These results lead to the variance of a linear combination as: \begin{align} \operatorname{Var}\left( \sum_{i=1}^N a_iX_i\right) &=\sum_{i,j=1}^{N} a_ia_j\operatorname{Cov}(X_i,X_j) \\ &= \sum_{i=1}^N a_i^2 \operatorname{Var}(X_i) + \sum_{i \neq j} a_i a_j \operatorname{Cov}(X_i,X_j)\\ &= \sum_{i=1}^N a_i^2 \operatorname{Var}(X_i) + 2 \sum_{1 \leq i If the random variables X_1,\dots,X_N are such that \operatorname{Cov}(X_i,X_j)=0\ ,\ \forall\ (i\ne j) , then they are said to be uncorrelated. It follows immediately from the expression given earlier that if the random variables X_1,\dots,X_N are uncorrelated, then the variance of their sum is equal to the sum of their variances, or, expressed symbolically: \operatorname{Var}\left(\sum_{i=1}^N X_i\right) = \sum_{i=1}^N\operatorname{Var}(X_i).

Since independent random variables are always uncorrelated (see ), the equation above holds in particular when the random variables X_1,\dots,X_n are independent. Thus, independence is sufficient but not necessary for the variance of the sum to equal the sum of the variances.

Matrix notation for the variance of a linear combination

Define X as a column vector of n random variables , and c as a column vector of n scalars . Therefore, c^\mathsf{T} X is a linear combination of these random variables, where c^\mathsf{T} denotes the transpose of . Also let \Sigma be the covariance matrix of .

The variance of c^\mathsf{T}X is then given by: \operatorname{Var}\left(c^\mathsf{T} X\right) = c^\mathsf{T} \Sigma c. This implies that the variance of the mean can be written as (with a column vector of ones) \operatorname{Var}\left(\bar{x}\right) = \operatorname{Var}\left(\frac{1}{n} 1'X\right) = \frac{1}{n^2} 1'\Sigma 1. \operatorname{Var}\left(\sum_{i=1}^n X_i\right) = \sum_{i=1}^n \operatorname{Var}(X_i). This statement is called the Bienaymé formula and was discovered in 1853.

It is often made with the stronger condition that the variables are independent, but being uncorrelated suffices. So if all the variables have the same variance , then, since division by is a linear transformation, this formula immediately implies that the variance of their mean is \operatorname{Var}\left(\overline{X}\right) = \operatorname{Var}\left(\frac{1}{n} \sum_{i=1}^n X_i\right) = \frac{1}{n^2}\sum_{i=1}^n \operatorname{Var}\left(X_i\right) = \frac{1}{n^2}n\sigma^2 = \frac{\sigma^2}{n}.

That is, the variance of the mean decreases when n increases. This formula for the variance of the mean is used in the definition of the standard error of the sample mean, which is used in the central limit theorem.

To prove the initial statement, it suffices to show that \operatorname{Var}(X + Y) = \operatorname{Var}(X) + \operatorname{Var}(Y). The general result then follows by induction. Starting with the definition, \begin{align} \operatorname{Var}(X + Y) &= \operatorname{E}\left[(X + Y)^2\right] - (\operatorname{E}[X + Y])^2 \\[5pt] &= \operatorname{E}\left[X^2 + 2XY + Y^2\right] - (\operatorname{E}[X] + \operatorname{E}[Y])^2. \end{align} Using the linearity of the expectation operator and the assumption of independence (or uncorrelatedness) of X and Y, this further simplifies as follows: \begin{align} \operatorname{Var}(X + Y) &= \operatorname{E}{\left[X^2\right]} + 2\operatorname{E}[XY] + \operatorname{E}{\left[Y^2\right]} - \left(\operatorname{E}[X]^2 + 2\operatorname{E}[X] \operatorname{E}[Y] + \operatorname{E}[Y]^2\right) \\[5pt] &= \operatorname{E}\left[X^2\right] + \operatorname{E}\left[Y^2\right] - \operatorname{E}[X]^2 - \operatorname{E}[Y]^2 \\[5pt] &= \operatorname{Var}(X) + \operatorname{Var}(Y). \end{align} \operatorname{Var}\left(\sum_{i=1}^n X_i\right) = \sum_{i=1}^n \sum_{j=1}^n \operatorname{Cov}\left(X_i,

X_j\right) = \sum_{i=1}^n \operatorname{Var}\left(X_i\right) + 2 \sum_{1 \leq i (Note: The second equality comes from the fact that .)

Here, \operatorname{Cov}(\cdot,\cdot) is the covariance, which is zero for independent random variables (if it exists). The formula states that the variance of a sum is equal to the sum of all elements in the covariance matrix of the components.

The next expression states equivalently that the variance of the sum is the sum of the diagonal of covariance matrix plus two times the sum of its upper triangular elements (or its lower triangular elements); this emphasizes that the covariance matrix is symmetric. This formula is used in the theory of Cronbach's alpha in classical test theory.

So, if the variables have equal variance and the average correlation of distinct variables is , then the variance of their mean is \operatorname{Var}\left(\overline{X}\right) = \frac{\sigma^2}{n} + \frac{n - 1}{n}\rho\sigma^2. This implies that the variance of the mean increases with the average of the correlations.

In other words, additional correlated observations are not as effective as additional independent observations at reducing the uncertainty of the mean. Moreover, if the variables have unit variance, for example if they are standardized, then this simplifies to \operatorname{Var}\left(\overline{X}\right) = \frac{1}{n} + \frac{n - 1}{n}\rho.

This formula is used in the Spearman–Brown prediction formula of classical test theory. This converges to if goes to infinity, provided that the average correlation remains constant or converges too.

So for the variance of the mean of standardized variables with equal correlations or converging average correlation we have \lim_{n \to \infty} \operatorname{Var}\left(\overline{X}\right) = \rho. Therefore, the variance of the mean of a large number of standardized variables is approximately equal to their average correlation.

This makes clear that the sample mean of correlated variables does not generally converge to the population mean, even though the law of large numbers states that the sample mean will converge for independent variables. \operatorname{Var}\left(\sum_{i=1}^{N}X_i\right)=\operatorname{E}\left[N\right]\operatorname{Var}(X)+\operatorname{Var}(N)(\operatorname{E}\left[X\right])^2 which follows from the law of total variance. If has a Poisson distribution, then \operatorname{E}[N]=\operatorname{Var}(N) with estimator .

So, the estimator of \textstyle \operatorname{Var}\left(\sum_{i=1}^{n}X_i\right) becomes , giving \textstyle \operatorname{SE}(\bar{X})=\sqrt{{({S_x}^2+\bar{X}^2)}/{n}} (see ). \operatorname{Var}(aX \pm bY) =a^2 \operatorname{Var}(X) + b^2 \operatorname{Var}(Y) \pm 2ab\, \operatorname{Cov}(X,

Y). This implies that in a weighted sum of variables, the variable with the largest weight will have a disproportionally large weight in the variance of the total. For example, if X and Y are uncorrelated and the weight of X is two times the weight of Y, then the weight of the variance of X will be four times the weight of the variance of Y. The expression above can be extended to a weighted sum of multiple variables: \operatorname{Var}\left(\sum_{i}^n a_iX_i\right) = \sum_{i=1}^na_i^2 \operatorname{Var}(X_i) + 2\sum_{1\le i}\sum_{ \operatorname{Var}(XY) = [\operatorname{E}(X)]^2 \operatorname{Var}(Y) + [\operatorname{E}(Y)]^2 \operatorname{Var}(X) + \operatorname{Var}(X)\operatorname{Var}(Y). Equivalently, using the basic properties of expectation, it is given by \operatorname{Var}(XY) = \operatorname{E}\left(X^2\right) \operatorname{E}\left(Y^2\right) - [\operatorname{E}(X)]^2 [\operatorname{E}(Y)]^2. \begin{align} \operatorname{Var}(XY) ={} &\operatorname{Cov}\left(X^2,

Y^2\right) + \left(\operatorname{Var}(X) + [\operatorname{E}(X)]^2\right) \left(\operatorname{Var}(Y) + [\operatorname{E}(Y)]^2\right) \\[5pt] &- [\operatorname{Cov}(X,

Y) + \operatorname{E}(X)\operatorname{E}(Y)]^2 \end{align} \operatorname{Var}\left[f(X)\right] \approx \left(f'(\operatorname{E}\left[X\right])\right)^2\operatorname{Var}\left[X\right] provided that is twice differentiable and that the mean and variance of are finite. \begin{align} \sigma^2 &= \frac{1}{N} \sum_{i=1}^N {\left(x_i - \mu\right)}^2 = \frac{1}{N} \sum_{i=1}^N \left(x_i^2 - 2 \mu x_i + \mu^2 \right) \\[5pt] &= \left(\frac{1}{N} \sum_{i=1}^N x_i^2\right) - 2\mu \left(\frac{1}{N} \sum_{i=1}^N x_i\right) + \mu^2 \\[5pt] &= \operatorname{E}[x_i^2] - \mu^2 , \end{align} where the population mean is \mu = \operatorname{E}[x_i] = \frac 1N \sum_{i=1}^N x_i and , where \operatorname{E} is the expectation value operator.

The population variance can also be computed using \sigma^2 = \frac {1} {N^2}\sum_{i (The right side has duplicate terms in the sum while the middle side has only unique terms to sum.) This is true because \begin{align} &\frac{1}{2N^2} \sum_{i, j=1}^N {\left( x_i - x_j \right)}^2 \\[5pt] ={} &\frac{1}{2N^2} \sum_{i, j=1}^N \left( x_i^2 - 2x_i x_j + x_j^2 \right) \\[5pt] ={} &\frac{1}{2N} \sum_{j=1}^N \left(\frac{1}{N} \sum_{i=1}^N x_i^2\right) - \left(\frac{1}{N} \sum_{i=1}^N x_i\right) \left(\frac{1}{N} \sum_{j=1}^N x_j\right) + \frac{1}{2N} \sum_{i=1}^N \left(\frac{1}{N} \sum_{j=1}^N x_j^2\right) \\[5pt] \tilde{S}_Y^2 = \frac{1}{n} \sum_{i=1}^n \left(Y_i - \overline{Y}\right)^2 = \left(\frac 1n \sum_{i=1}^n Y_i^2\right) - \overline{Y}^2 = \frac{1}{n^2} \sum_{i,j\,:\,i (See the section for the derivation of this formula.)

Here, \overline{Y} denotes the sample mean: \overline{Y} = \frac{1}{n} \sum_{i=1}^n Y_i. Since the are selected randomly, both \overline{Y} and \tilde{S}_Y^2 are random variables. Their expected values can be evaluated by averaging over the ensemble of all possible samples of size from the population.

For \tilde{S}_Y^2 this gives: \begin{align} \operatorname{E}[\tilde{S}_Y^2] &= \operatorname{E}\left[ \frac{1}{n} \sum_{i=1}^n {\left(Y_i - \frac{1}{n} \sum_{j=1}^n Y_j \right)}^2 \right] \\[5pt] &= \frac 1n \sum_{i=1}^n \operatorname{E}\left[ Y_i^2 - \frac{2}{n} Y_i \sum_{j=1}^n Y_j + \frac{1}{n^2} \sum_{j=1}^n Y_j \sum_{k=1}^n Y_k \right] \\[5pt] &= \frac 1n \sum_{i=1}^n \left( \operatorname{E}\left[Y_i^2\right] - \frac{2}{n} \left( \sum_{j \neq i} \operatorname{E}\left[Y_i Y_j\right] + \operatorname{E}\left[Y_i^2\right] \right) + \frac{1}{n^2} \sum_{j=1}^n \sum_{k \neq j}^n \operatorname{E}\left[Y_j Y_k\right] +\frac{1}{n^2} \sum_{j=1}^n \operatorname{E}\left[Y_j^2\right] \right) \\[5pt] &= \frac 1n \sum_{i=1}^n \left( \frac{n - 2}{n} \operatorname{E}\left[Y_i^2\right] - \frac{2}{n} \sum_{j \neq i} \operatorname{E}\left[Y_i Y_j\right] + \frac{1}{n^2} \sum_{j=1}^n \sum_{k \neq j}^n \operatorname{E}\left[Y_j Y_k\right] +\frac{1}{n^2} \sum_{j=1}^n \operatorname{E}\left[Y_j^2\right] \right) \\[5pt] &= \frac 1n \sum_{i=1}^n \left[ \frac{n - 2}{n} \left(\sigma^2 + \mu^2\right) - \frac{2}{n} (n - 1)\mu^2 + \frac{1}{n^2} n(n - 1)\mu^2 + \frac{1}{n} \left(\sigma^2 + \mu^2\right) \right] \\[5pt] &= \frac{n - 1}{n} \sigma^2. \end{align} Here \sigma^2 = \operatorname{E}[Y_i^2] - \mu^2 derived in the section is population variance and \operatorname{E}[Y_i Y_j] = \operatorname{E}[Y_i] \operatorname{E}[Y_j] = \mu^2 due to independency of Y_i and . Hence \tilde{S}_Y^2 gives an estimate of the population variance \sigma^2 that is biased by a factor of \frac{n - 1}{n} because the expectation value of \tilde{S}_Y^2 is smaller than the population variance (true variance) by that factor.

For this reason, \tilde{S}_Y^2 is referred to as the biased sample variance. S^2 = \frac{n}{n - 1} \tilde{S}_Y^2 = \frac{n}{n - 1} \left[ \frac{1}{n} \sum_{i=1}^n \left(Y_i - \overline{Y}\right)^2 \right] = \frac{1}{n - 1} \sum_{i=1}^n \left(Y_i - \overline{Y} \right)^2 Either estimator may be simply referred to as the sample variance when the version can be determined by context.

The same proof is also applicable for samples taken from a continuous probability distribution. The use of the term is called Bessel's correction, and it is also used in sample covariance and the sample standard deviation (the square root of variance).

The square root is a concave function and thus introduces negative bias (by Jensen's inequality), which depends on the distribution, and thus the corrected sample standard deviation (using Bessel's correction) is biased. The unbiased estimation of standard deviation is a technically involved problem, though for the normal distribution using the term yields an almost unbiased estimator.

The unbiased sample variance is a U-statistic for the function , meaning that it is obtained by averaging a 2-sample statistic over 2-element subsets of the population. (n - 1) \frac{S^2}{\sigma^2} \sim \chi^2_{n-1} , where is the population variance.

As a direct consequence, it follows that \operatorname{E}\left(S^2\right) = \operatorname{E}\left(\frac{\sigma^2}{n - 1} \chi^2_{n-1}\right) = \sigma^2 , and \operatorname{Var}\left[S^2\right] = \operatorname{Var}\left(\frac{\sigma^2}{n - 1} \chi^2_{n-1}\right) = \frac{\sigma^4}{{\left(n - 1\right)}^2} \operatorname{Var}\left(\chi^2_{n-1}\right) = \frac{2\sigma^4}{n - 1}. If are independent and identically distributed, but not necessarily normally distributed, then \operatorname{E}\left[S^2\right] = \sigma^2; \quad \operatorname{Var}\left[S^2\right] = \frac{\sigma^4}{n} \left(\kappa - 1 + \frac{2}{n - 1} \right) = \frac{1}{n} \left(\mu_4 - \frac{n - 3}{n - 1}\sigma^4\right), where κ is the kurtosis of the distribution and is the fourth central moment.

If the conditions of the law of large numbers hold for the squared observations, is a consistent estimator of  . One can see indeed that the variance of the estimator tends asymptotically to zero.

An asymptotically equivalent formula was given in Kenney and Keeping (1951:164), Rose and Smith (2002:264), and Weisstein (n.d.). n s_{n+1}^2 = (n-1)s_n^2 + \frac{n}{n+1}(x_{n+1} - \bar{x}_n)^2 From this relationship, the impact of the new observation on the variance depends on its distance from the current mean. If x_{n+1} = \bar{x}_n \pm s_n \sqrt{\frac{n+1}{n}} , then the variance will remain unchanged.

Accordingly, if the new observation is closer to the mean ( |x_{n+1}| ), then the variance will decrease - and if is further from the mean ( |x_{n+1}| > \bar{x}_n + s_n \sqrt{\frac{n+1}{n}} ), then the variance will increase. Derivation for Sample Variance Using the updating formula for the sum of squares ( SS ): SS_{n+1} = SS_n + \frac{n}{n+1}(x_{n+1} - \bar{x}_n)^2 Substituting the relationship for sample variance ( SS = (n-1)s^2 ): n s^2_{n+1} = (n-1)s^2_n + \frac{n}{n+1}(x_{n+1} - \bar{x}_n)^2 Setting s^2_{n+1} = s^2_n : n s^2_n = (n-1)s^2_n + \frac{n}{n+1}(x_{n+1} - \bar{x}_n)^2 s^2_n = \frac{n}{n+1}(x_{n+1} - \bar{x}_n)^2 Solving for x_{n+1} yields: x_{n+1} = \bar{x}_n \pm s_n \sqrt{\frac{n+1}{n}} Derivation for Population Variance For population variance ( \sigma^2 = \frac{SS}{n} ), the updating formula is: (n+1)\sigma^2_{n+1} = n\sigma^2_n + \frac{n}{n+1}(x_{n+1} - \mu_n)^2 Setting \sigma^2_{n+1} = \sigma^2_n : (n+1)\sigma^2_n = n\sigma^2_n + \frac{n}{n+1}(x_{n+1} - \mu_n)^2 \sigma^2_n = \frac{n}{n+1}(x_{n+1} - \mu_n)^2 Solving for x_{n+1} yields: x_{n+1} = \mu_n \pm \sigma_n \sqrt{\frac{n+1}{n}} \sigma_y^2 \le 2y_{\max} (A - H) , where is the maximum of the sample, is the arithmetic mean, is the harmonic mean of the sample and \sigma_y^2 is the (biased) variance of the sample.

This bound has been improved, and it is known that variance is bounded by \begin{align} \sigma_y^2 &\le \frac{y_{\max} (A - H)(y_\max - A)}{y_\max - H}, \\[1ex] \sigma_y^2 &\ge \frac{y_{\min} (A - H)(A - y_\min)}{H - y_\min}, \end{align} where is the minimum of the sample. I = n\left(\mathbf{1}_{3\times 3} \operatorname{tr}(\Sigma) - \Sigma\right).

This difference between moment of inertia in physics and in statistics is clear for points that are gathered along a line. Suppose many points are close to the x axis and distributed along it. The covariance matrix might look like \Sigma = \begin{bmatrix} 10 & 0 & 0 \\ 0 & 0.1 & 0 \\ 0 & 0 & 0.1 \end{bmatrix}.

That is, there is the most variance in the x direction. Physicists would consider this to have a low moment about the x axis so the moment-of-inertia tensor is I = n\begin{bmatrix} 0.2 & 0 & 0 \\ 0 & 10.1 & 0 \\ 0 & 0 & 10.1 \end{bmatrix}. \text{Semivariance} = \frac{1}{n} \sum_{i:x_i It is also described as a specific measure in different fields of application.

For skewed distributions, the semivariance can provide additional information that a variance does not. For inequalities associated with the semivariance, see .

If X is a vector-valued random variable, with values in \mathbb{R}^n, and thought of as a column vector, then a natural generalization of variance is \operatorname{E}\left[(X - \mu) {(X - \mu)}^{\mathsf{T}}\right], where \mu = \operatorname{E}(X) and X^{\mathsf{T}} is the transpose of , and so is a row vector. The result is a positive semi-definite square matrix, commonly referred to as the variance-covariance matrix (or simply as the covariance matrix).

If X is a vector- and complex-valued random variable, with values in , then the covariance matrix is , where X^\dagger is the conjugate transpose of . This matrix is also positive semi-definite and square.

A different generalization is obtained by considering the equation for the scalar variance, \operatorname{Var}(X) = \operatorname{E}\left[(X - \mu)^2 \right], and reinterpreting (X - \mu)^2 as the squared Euclidean distance between the random variable and its mean, or, simply as the scalar product of the vector X - \mu with itself. This results in \operatorname{E}\left[(X - \mu)^{\mathsf{T}}(X - \mu)\right] = \operatorname{tr}(C), which is the trace of the covariance matrix.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1368633150 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001368633150 · captured 2026-08-10 · ledger · version history

Cite this page as: encyclopegia.org, “Variance”, snapshot enwiki-001368633150. https://encyclopegia.org/a/variance

Sources cited in this revision

11 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.