Moment (mathematics)

From Wikipedia, the free encyclopedia

"Second moment" redirects here. For the technique in probability theory, see Second moment method.

See also: Moment (physics)

The concept of moment in mathematics evolved from the concept of moment in physics. The nth moment of a real-valued function f(x) of a real variable about a value c is

$\mu'_n=\int_{-\infty}^\infty (x - c)^n\,f(x)\,dx.$

It is possible to define moments for random variables in a more general fashion than moments for real values. See Moments in metric spaces.

The moments about zero are usually referred to simply as the moments of a function. Usually, except in the special context of the problem of moments, the function will be a probability density function. The n^th moment (about zero) of a probability density function f(x) is the expected value of Xⁿ. The moments about its mean μ are called central moments; these describe the shape of the function, independently of translation.

If f is a probability density function, then the value integral above is called the nth moment of the probability distribution. More generally, if F is a cumulative probability distribution function of any probability distribution, which may not have a density function, then the nth moment of the probability distribution is given by the Riemann-Stieltjes integral

$\mu'_n = \operatorname{E}(X^n)=\int_{-\infty}^\infty x^n\,dF(x)\,$

where X is a random variable that has this distribution and E the expectation operator.

When

$\operatorname{E}(|X^n|) = \int_{-\infty}^\infty |x^n|\,dF(x) = \infty,\,$

then the moment is said not to exist. If the nth moment about any point exists, so does (n − 1)th moment, and all lower-order moments, about every point.

[edit] Significance of the moments

Increasing each of the first four moments in turn whilst keeping the others constant, for a discrete uniform distribution with four values.

The first moment about zero, if it exists, is the expectation of X, i.e. the mean of the probability distribution of X, designated μ. In higher orders, the central moments are more interesting than the moments about zero.

The nth central moment of the probability distribution of a random variable X is

$\mu_n=E((X-\mu)^n).\,$

The first central moment is thus 0.

[edit] Variance

The second central moment is the variance, the positive square root of which is the standard deviation, σ.

[edit] Normalized moments

The normalized nth central moment or standardized moment is the nth central moment divided by σⁿ; the normalized nth central moment of x = E((x − μ)ⁿ)/σⁿ. These normalized central moments are dimensionless quantities, which represent the distribution independently of any linear change of scale.

[edit] Skewness

The third central moment is a measure of the lopsidedness of the distribution; any symmetric distribution will have a third central moment, if defined, of zero. The normalized third central moment is called the skewness, often γ. A distribution that is skewed to the left (the tail of the distribution is heavier on the right) will have a negative skewness. A distribution that is skewed to the right (the tail of the distribution is heavier on the left), will have a positive skewness.

For distributions that are not too different from the normal (or "Gaussian") distribution, the median will be somewhere near μ − γσ/6; the mode about μ − γσ/2.

[edit] Kurtosis

The fourth central moment is a measure of whether the distribution is tall and skinny or short and squat, compared to the normal distribution of the same variance. Since it is the expectation of a fourth power, the fourth central moment, where defined, is always positive; and except for a point distribution, it is always strictly positive. The fourth central moment of a normal distribution is 3σ⁴.

The kurtosis κ is defined to be the normalized fourth central moment minus 3. (Equivalently, as in the next section, it is the fourth cumulant divided by the square of the variance.) Some authorities do not subtract three, but it is usually more convenient to have the normal distribution at the origin of coordinates. If a distribution has a peak at the mean and long tails, the fourth moment will be high and the kurtosis positive; and conversely; thus, bounded distributions tend to have low kurtosis.

The kurtosis can be positive without limit, but κ must be greater than or equal to γ² − 2; equality only holds for binary distributions. For unbounded skew distributions not too far from normal, κ tends to be somewhere in the area of γ² and 2γ².

The inequality can be proven by considering

$\operatorname{E} ((T^2 - aT)^2)\,$

where T = (X − μ)/σ. This is the expectation of a square, so it is non-negative whatever a is; on the other hand, it's also a quadratic equation in a. Its discriminant must be non-positive, which gives the required relationship.

[edit] Cumulants

The first moment and the second and third unnormalized central moments are linear in the sense that if X and Y are independent random variables then

$\mu_1(X+Y)=\mu_1(X)+\mu_1(Y)\,$

and

$\operatorname{var}(X+Y)=\operatorname{var}(X)+\operatorname{var}(Y)$

and

$\mu_3(X+Y)=\mu_3(X)+\mu_3(Y).\,$

(These can also hold for variables that satisfy weaker conditions than independence. The first always holds; if the second holds, the variables are called uncorrelated).

This is true because these moments are the first three cumulants; the fourth cumulant is the kurtosis times σ⁴.

All the cumulants are polynomials in the moments; so are the factorial moments. The central moments are polynomials in the moments about zero, and conversely.

[edit] Sample moments

The moments of a population can be estimated using the sample k-th moment

$\frac{1}{n}\sum_{i = 1}^{n} X^k_i\,\!$

applied to a sample X₁,X₂,..., X_n drawn from the population.

It can be trivially shown that the expected value of the sample moment is equal to the k-th moment of the population, if that moment exists, for any sample size n. It is thus an unbiased estimator.

[edit] Problem of moments

The problem of moments seeks characterizations of sequences { μ′_n : n = 1, 2, 3, ... } that are sequences of moments of some function f.

[edit] Partial moments

Partial moments are sometimes referred to as "one-sided moments." The nth order lower and upper partial moments with respect to a reference point r may be expressed as

$\mu_n^-(r)=\int_{-\infty}^r (r - x)^n\,f(x)\,dx,$

$\mu_n^+(r)=\int_r^\infty (x - r)^n\,f(x)\,dx.$

Partial moments are normalized by being raised to the power 1/n. The upside potential ratio may be expressed as a ratio of a first-order upper partial moment to a normalized second-order lower partial moment.

[edit] Moments in metric spaces

Let (M, d) be a metric space, and let B(M) be the Borel σ-algebra on M, the σ-algebra generated by the d-open subsets of M. (For technical reasons, it is also convenient to assume that M is a separable space with respect to the metric d.) Let 1 ≤ p ≤ +∞.

The p^th moment of a measure μ on the measurable space (M, B(M)) about a given point x₀ in M is defined to be

$\int_{M} d(x, x_{0})^{p} \, \mathrm{d} \mu (x).$

μ is said to have finite p^th moment if the p^th moment of μ about x₀ is finite for some x₀ ∈ M.

This terminology for measures carries over to random variables in the usual way: if (Ω, Σ, P) is a probability space and X : Ω → M is a random variable, then the p^th moment of X about x₀ ∈ M is defined to be

$\int_{M} d (x, x_{0})^{p} \, \mathrm{d} \left( X_{*} (\mathbf{P}) \right) (x) \equiv \int_{\Omega} d (X(\omega), x_{0})^{p} \, \mathrm{d} \mathbf{P} (\omega),$

and X has finite p^th moment if the p^th moment of X about x₀ is finite for some x₀ ∈ M.

[edit] See also

[edit] External links

Mathworld Website

Moment (mathematics)

From Wikipedia, the free encyclopedia

Contents

[edit] Significance of the moments

[edit] Variance

[edit] Normalized moments

[edit] Skewness

[edit] Kurtosis

[edit] Cumulants

[edit] Sample moments

[edit] Problem of moments

[edit] Partial moments

[edit] Moments in metric spaces

[edit] See also

[edit] External links

Views

Personal tools

Navigation

Search

Interaction

Toolbox

Languages