The moments of a function are quantities pertaining to the shape of the function's graph. Although general mathematical concepts, they are most commonly used in statistics to describe the shape of a probability distribution. A real-valued function has countably infinite moments , indexed by their order and defined as
depending on whether the function is discrete or continuous. These moments are about the origin. A more general form that defines the moments about an arbitrary point is
Moments have the interesting property that the (infinite) set of all moments fully determines the function . As such, if the set of moments is available, it is possible to draw conclusions about without using it directly. More realistically, even an incomplete set of moments can give very valuable information about the shape and behavior of .
For random variables#
Moments are particularly useful in the context of random variables since they give information on the distribution they follow. In this context, the moments gain specific interpretations.
Consider a random variable (assumed continuous; for a discrete one, just change integrals into series). The moments about zero take the name of raw or algebraic moments of order and are defined as the expected value of the -th power of :
is the probability density function. The first couple of moments are: 0. is the normalization condition for .
- is the expected value (mean) of , an index of central tendency.
Orders 2 and up don't have a clear interpretation and are therefore mostly unused.
The central moments of order are instead defined as the expected values of powers about the mean:
The first few moments are 0. is again the normalization condition for .
- is expected value of .
- is the variance of , an index of statistical dispersion.
- is an index of asymmetry.
- is an index of "tailedness".
Orders 5 and up don't have an easy interpretation. For orders 3 and up, we define coefficients or standardized moments, which are divided by some power of the variance and are thus scale-independent. The asymmetry coefficient is called skewness and, just like , it represents how asymmetrical is:
The higher it is, the more slanted and asymmetrical the distribution is. It is zero if the distribution is symmetrical about .
The flatness coefficient is called kurtosis and, just like , it represents how tall the "tails" of is:
The term is a completely arbitrary choice and was historically decided just so the kurtosis of the Gaussian distribution would be zero. The higher it is, the taller the "tails" of the distribution (going to ) are.
Equality of distributions with same moments#
Say we have two probability density functions and for the same random variable . If the set of all moments (either raw or central) is the same for both functions, then .
> The square of the difference is > $$[f_{1}(x)-f_{2}(x)]^{2}=\sum_{n=0}^{\infty} c_{n}x^{n}[f_{1}(x)-f_{2}(x)]> if $\mu_{n,1}^{*}=\mu_{n,2}^{*}$ for all $n$. Thus, $f_{1}(x)=f_{2}(x)$ over all $\Omega$. If nothing else, this is further proof that the probability distribution of a random variable is unique.and if we integrate over the sample space of , we get
\int_{\Omega}[f_{1}(x)-f_{2}(x)]^{2}\ dx&=\sum_{n=0}^{\infty} c_{n}\int_{\Omega}x^{n}[f_{1}(x)-f_{2}(x)]\ dx \\ &=\sum_{n=0}^{\infty} c_{n}\left( \int_{\Omega}x^{n}f_{1}(x)\ dx-\int_{\Omega}x^{n}f_{2}(x)\ dx \right) \\ &=\sum_{n=0}^{\infty} c_{n}[\mu_{n,1}^{*}-\mu_{n,2}^{*}] \\ &=0 \end{align}