Math 2.0

definition

Cumulant generating function

Definition

Let XX be a real random variable with moment-generating function MXM_X. The cumulant generating function of XX is KX(t)=ln⁡MX(t)=ln⁡E[etX],K_X(t) = \ln M_X(t) = \ln E\left[e^{tX}\right], for each t∈Rt \in \mathbb{R} with MX(t)<∞M_X(t) < \infty. If MXM_X is finite on an open interval around 00, the cumulants κn\kappa_n of XX are the coefficients in KX(t)=∑n=1∞κntn/n!K_X(t) = \sum_{n=1}^{\infty} \kappa_n t^n / n!, so κn=KX(n)(0)\kappa_n = K_X^{(n)}(0).

Remarks

The first cumulants are κ1=E[X]\kappa_1 = E[X], κ2=Var⁡(X)\kappa_2 = \operatorname{Var}(X) and κ3=E[(X−E[X])3]\kappa_3 = E[(X - E[X])^3]. For independent XX and YY, KX+Y=KX+KYK_{X+Y} = K_X + K_Y by the product rule for moment-generating functions. So cumulants of independent sums add. For X∼N(μ,σ2)X \sim \mathcal{N}(\mu, \sigma^2), KX(t)=μt+σ2t2/2K_X(t) = \mu t + \sigma^2 t^2 / 2. For X∼Poisson⁡(λ)X \sim \operatorname{Poisson}(\lambda), KX(t)=λ(et−1)K_X(t) = \lambda(e^t - 1), so all cumulants equal λ\lambda. KXK_X is convex on the interval where it is finite.

Explanations

L1 human

Taking the logarithm turns products into sums. So the cumulant generating function of a sum of independent variables is the sum of their cumulant generating functions. This makes cumulants convenient for sums, for example in the central limit theorem.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Cumulant, Definition