Moments of Discrete Random Variables

Defines the k-th moment and k-th central moment of a discrete random variable, and develops fluency computing them directly from the PMF using the formula E[g(X)] = sum g(x) p(x).

Step 1 of 119%

Tutorial

The k-th Moment of a Discrete Random Variable

Let XX be a discrete random variable with PMF p(x)p(x). For a positive integer kk, the kk-th moment of XX is defined as

E[Xk]  =  xxkp(x).E[X^k] \;=\; \sum_x x^k\, p(x).

This is the expectation of the transformed variable XkX^k -- a direct application of E[g(X)]=xg(x)p(x)E[g(X)] = \sum_x g(x)\,p(x) with g(x)=xkg(x)=x^k. The first moment E[X]E[X] is the mean of XX. The second moment E[X2]E[X^2] measures the average squared value of XX and appears throughout the theory of variance.

For example, let XX have PMF

P(X=0)=14,P(X=1)=12,P(X=2)=14.P(X=0)=\dfrac{1}{4},\qquad P(X=1)=\dfrac{1}{2},\qquad P(X=2)=\dfrac{1}{4}.

Then

E[X2]=0214  +  1212  +  2214=0+12+1=32.\begin{align*} E[X^2] &= 0^2\cdot\dfrac{1}{4} \;+\; 1^2\cdot\dfrac{1}{2} \;+\; 2^2\cdot\dfrac{1}{4} \\[3pt] &= 0 + \dfrac{1}{2} + 1 \\[3pt] &= \dfrac{3}{2}. \end{align*}

The same recipe gives E[X3]E[X^3], E[X4]E[X^4], and so on -- just replace the exponent.

navigate · Enter open · Esc close · ⌘K/Ctrl K toggle