Skip to main content

02. Expectation, Moments, and Characteristic Functions — Numerical Summaries of Distributions

Background 2/5. This page organizes the tools for summarizing the infinite-dimensional object called a distribution with finitely many numbers (moments) and one function (the characteristic function). The characteristic function is the only practical means of defining alpha-stable distributions, so it receives particular attention.

Expectation

The expectation of a random variable XX is an integral with respect to a probability measure.

E[X]=ΩX(ω)dP(ω)=xdμX(x)\mathbb{E}[X] = \int_{\Omega} X(\omega)\, dP(\omega) = \int_{-\infty}^{\infty} x \, d\mu_X(x)

In practical terms:

  • Discrete: E[X]=xxpX(x)\mathbb{E}[X] = \sum_x x \, p_X(x)
  • Continuous: E[X]=xfX(x)dx\mathbb{E}[X] = \int_{-\infty}^{\infty} x f_X(x)\, dx

LOTUS (law of the unconscious statistician)

For a function gg, the following holds without having to derive the distribution of g(X)g(X) anew.

E[g(X)]=g(x)fX(x)dx\mathbb{E}[g(X)] = \int_{-\infty}^{\infty} g(x) f_X(x)\, dx

Properties of expectation

  • Linearity: E[aX+bY]=aE[X]+bE[Y]\mathbb{E}[aX + bY] = a\,\mathbb{E}[X] + b\,\mathbb{E}[Y] — this holds even without independence.
  • Product under independence: if XYX \perp Y, then E[XY]=E[X]E[Y]\mathbb{E}[XY] = \mathbb{E}[X]\,\mathbb{E}[Y]
  • Existence condition: saying that E[X]\mathbb{E}[X] "exists" means that E[X]\mathbb{E}[\lvert X \rvert] is finite. Not every distribution has an expectation.
Distributions without expectations are not pathological exceptions

The Cauchy distribution f(x)=1π(1+x2)f(x) = \frac{1}{\pi(1+x^2)} has no defined mean because xf(x)dx=\int \lvert x \rvert f(x)\, dx = \infty. The Cauchy distribution is the α=1\alpha = 1 special case of an alpha-stable distribution, and it arises naturally when modeling the heavy tails of real data such as financial returns and network latency. The intuition that "we can just take the sample mean" collapses for these distributions—the sample mean does not converge regardless of how many samples are collected.

Variance and higher moments

The kkth moment is E[Xk]\mathbb{E}[X^k], and the kkth central moment is E[(Xμ)k]\mathbb{E}[(X-\mu)^k] (μ=E[X]\mu = \mathbb{E}[X]).

Variance (second central moment)

Var(X)=E[(Xμ)2]=E[X2]μ2\mathrm{Var}(X) = \mathbb{E}[(X-\mu)^2] = \mathbb{E}[X^2] - \mu^2
  • Var(aX+b)=a2Var(X)\mathrm{Var}(aX + b) = a^2 \mathrm{Var}(X)
  • Under independence, Var(X+Y)=Var(X)+Var(Y)\mathrm{Var}(X+Y) = \mathrm{Var}(X) + \mathrm{Var}(Y) — this is why the n\sqrt{n} scaling appears in the CLT.

Skewness and kurtosis (third and fourth standardized moments)

skewness=E[(Xμσ)3],kurtosis=E[(Xμσ)4]\text{skewness} = \mathbb{E}\Big[\Big(\frac{X-\mu}{\sigma}\Big)^3\Big], \qquad \text{kurtosis} = \mathbb{E}\Big[\Big(\frac{X-\mu}{\sigma}\Big)^4\Big]
  • Skewness measures asymmetry. Depending on its parameters, a Beta distribution can lean in either direction.
  • Kurtosis measures tail thickness. A Gaussian has kurtosis exactly 3, which serves as the reference point for measuring excess kurtosis.

The hierarchy of moment existence

If E[Xk]\mathbb{E}[\lvert X \rvert^k] is finite, every lower-order moment is also finite. The converse does not hold. Each distribution differs in "the highest order that exists," making this a quantitative indicator of tail thickness.

DistributionExisting moments
GaussianEvery order
BetaEvery order (because its support is bounded)
Alpha-stable (α<2\alpha \lt 2)Only orders k<αk \lt \alpha — the variance is always infinite
Cauchy (α=1\alpha = 1)Not even the first moment (mean)

Moment-generating function (MGF)

MX(t)=E[etX]M_X(t) = \mathbb{E}[e^{tX}]

If it exists near 0, every moment can be obtained through differentiation: MX(k)(0)=E[Xk]M_X^{(k)}(0) = \mathbb{E}[X^k]. It also factors into a product for independent sums.

MX+Y(t)=MX(t)MY(t)(XY)M_{X+Y}(t) = M_X(t)\, M_Y(t) \quad (X \perp Y)

Limitation: the MGF does not exist if the integral of etXe^{tX} diverges. Distributions whose tails decay polynomially (including alpha-stable distributions) have no MGF. We therefore need a more powerful tool.

Characteristic function

φX(t)=E[eitX]=eitxfX(x)dx\varphi_X(t) = \mathbb{E}[e^{itX}] = \int_{-\infty}^{\infty} e^{itx} f_X(x)\, dx

This is the Fourier transform of the density. Its decisive advantages are:

  1. It always exists. Because eitX=1\lvert e^{itX} \rvert = 1, the integral converges for every distribution. Even a Cauchy distribution without a mean has a perfectly valid characteristic function.
  2. It uniquely determines the distribution (Lévy's inversion theorem). If φX=φY\varphi_X = \varphi_Y, then XX and YY have the same distribution.
  3. An independent sum becomes a product: φX+Y(t)=φX(t)φY(t)\varphi_{X+Y}(t) = \varphi_X(t)\varphi_Y(t)
  4. It determines convergence (Lévy's continuity theorem): pointwise convergence of characteristic functions is equivalent to convergence in distribution. The proof of the CLT stands on this theorem.

Representative characteristic functions

Distributionφ(t)\varphi(t)
Gaussian N(μ,σ2)\mathcal{N}(\mu, \sigma^2)exp(iμt12σ2t2)\exp\big(i\mu t - \tfrac{1}{2}\sigma^2 t^2\big)
Cauchy (location 0, scale 1)exp(t)\exp(-\lvert t \rvert)
Alpha-stable (symmetric, scale 1)exp(tα)\exp(-\lvert t \rvert^{\alpha})

The third row makes it immediately apparent that the Gaussian (α=2\alpha=2) and Cauchy (α=1\alpha=1) distributions are two ends of the same family. The unity invisible in density functions is exposed in characteristic-function space—this is why an alpha-stable distribution is defined through its characteristic function.

Relationship to moments

If E[Xk]\mathbb{E}[\lvert X \rvert^k] is finite, then φX\varphi_X is kk times differentiable and φX(k)(0)=ikE[Xk]\varphi_X^{(k)}(0) = i^k \mathbb{E}[X^k]. Conversely, a characteristic function that is not smooth at the origin signals that the corresponding moment does not exist. The fact that exp(t)\exp(-\lvert t \rvert) is not differentiable at the origin and the fact that the Cauchy distribution has no mean are two expressions of the same fact.

Inequality toolbox

  • Markov: P(Xa)E[X]/aP(\lvert X \rvert \ge a) \le \mathbb{E}[\lvert X \rvert]/a
  • Chebyshev: P(Xμkσ)1/k2P(\lvert X - \mu \rvert \ge k\sigma) \le 1/k^2 — holds regardless of the distribution as long as the variance exists
  • Jensen: if gg is convex, then g(E[X])E[g(X)]g(\mathbb{E}[X]) \le \mathbb{E}[g(X)]

Chebyshev gives the shortest proof of the law of large numbers.

What to remember from this page

  1. Expectations and variances may not exist. Their existence is itself an important property of a distribution.
  2. The range of existing moments is a quantitative indicator of tail thickness.
  3. The MGF is powerful but fails for heavy tails. A characteristic function always exists, uniquely determines the distribution, and turns independent sums into products.
  4. Gaussian and Cauchy distributions are the α=2,1\alpha = 2, 1 cases of the characteristic-function family exp(tα)\exp(-\lvert t \rvert^{\alpha}).

Next step