Moment Generating Function of Poisson Distribution is a fundamental concept in probability theory and statistical inference, providing a powerful tool for understanding the characteristics of the Poisson distribution. The moment generating function (MGF) encapsulates all the moments of a random variable, offering insights into its mean, variance, skewness, and higher-order moments. In the context of the Poisson distribution—a discrete probability distribution often used to model the number of events occurring within a fixed interval—understanding its MGF is essential for both theoretical developments and practical applications. This article delves deeply into the derivation, properties, and applications of the moment generating function for the Poisson distribution.
Introduction to Poisson Distribution
Before exploring the MGF, it is vital to understand the Poisson distribution itself. Named after the French mathematician Siméon Denis Poisson, this distribution is widely used in fields such as telecommunications, finance, biology, and physics to model count data.
Definition and Probability Mass Function
The Poisson distribution models the probability of observing a number of events \(k\) in a fixed interval of time or space, given an average rate \(\lambda\). Its probability mass function (PMF) is:\[ P(X = k) = \frac{\lambda^k e^{-\lambda}}{k!}, \quad k = 0, 1, 2, \ldots \]
where:
- \(\lambda > 0\) is the average number of events in the interval,
- \(k!\) is the factorial of \(k\).
The key properties include:
- Mean: \(E[X] = \lambda\),
- Variance: \(Var(X) = \lambda\),
- The distribution is supported over all non-negative integers.
Understanding the Moment Generating Function (MGF)
The moment generating function of a random variable \(X\), denoted by \(M_X(t)\), is defined as:
\[ M_X(t) = E[e^{tX}] \]
for values of \(t\) where the expectation exists (i.e., the integral or sum converges). The MGF is called "moment generating" because it encodes all the moments of \(X\). Specifically, the \(n\)-th moment of \(X\) can be obtained by differentiating \(M_X(t)\) \(n\) times with respect to \(t\) and evaluating at \(t=0\):
\[ E[X^n] = M_X^{(n)}(0) = \left.\frac{d^n}{dt^n} M_X(t)\right|_{t=0} \]
The MGF plays a crucial role in probability theory:
- It simplifies the process of finding moments.
- It facilitates the derivation of distributional properties.
- It helps in proving limit theorems, such as the Central Limit Theorem.
Derivation of the MGF for Poisson Distribution
Let's derive the MGF of a Poisson-distributed random variable \(X\sim \text{Poisson}(\lambda)\).
Step-by-step derivation
Starting from the definition:\[ M_X(t) = E[e^{tX}] = \sum_{k=0}^{\infty} e^{tk} P(X=k) \]
Substitute the PMF:
\[ M_X(t) = \sum_{k=0}^{\infty} e^{tk} \frac{\lambda^k e^{-\lambda}}{k!} \]
Factor out constants:
\[ M_X(t) = e^{-\lambda} \sum_{k=0}^{\infty} \frac{(\lambda e^{t})^k}{k!} \]
Recognize the power series expansion of the exponential function:
\[ \sum_{k=0}^{\infty} \frac{x^k}{k!} = e^{x} \]
Applying this, we get:
\[ M_X(t) = e^{-\lambda} \times e^{\lambda e^{t}} = \exp\left( -\lambda + \lambda e^{t} \right) \]
Thus, the moment generating function of the Poisson distribution is:
\[ \boxed{ M_X(t) = \exp \left( \lambda (e^{t} - 1) \right) } \]
This elegant closed-form expression is valid for all real \(t\), given that the exponential function is defined everywhere.
Properties of the Poisson MGF
The MGF of the Poisson distribution exhibits several important properties that make it a valuable analytical tool.
Key Properties
- Existence: The MGF \(M_X(t) = \exp(\lambda (e^{t} - 1))\) exists for all real \(t\), reflecting the moment-generating nature of the function.
- Moments:
- The mean: \(E[X] = M_X'(0) = \lambda\).
- The variance: \(Var(X) = M_X''(0) - (M_X'(0))^2 = \lambda\).
- Additivity: If \(X_1, X_2, \ldots, X_n\) are independent Poisson random variables with parameters \(\lambda_1, \lambda_2, \ldots, \lambda_n\), then their sum \(S = \sum_{i=1}^n X_i\) is also Poisson with parameter \(\sum_{i=1}^n \lambda_i\). The MGF reflects this property:
\[ M_S(t) = \prod_{i=1}^n M_{X_i}(t) = \exp \left( \left(\sum_{i=1}^n \lambda_i\right) (e^{t} - 1) \right) \]
- Limit relations: The Poisson distribution can be viewed as a limit of binomial distributions with parameters \(n\) and \(p \to 0\), \(np \to \lambda\). The MGFs of the binomial and Poisson distributions are connected accordingly.
Deriving Moments from the MGF
The moments of the Poisson distribution can be obtained through derivatives of the MGF:- First moment (mean):
\[ E[X] = M_X'(0) = \left. \frac{d}{dt} \exp (\lambda (e^{t} - 1)) \right|_{t=0} \]
Calculating:
\[ M_X'(t) = \exp (\lambda (e^{t} - 1)) \times \lambda e^{t} \]
At \(t=0\):
\[ E[X] = M_X'(0) = \exp(0) \times \lambda e^{0} = \lambda \]
- Second moment:
\[ E[X^2] = M_X''(0) = \left. \frac{d^2}{dt^2} M_X(t) \right|_{t=0} \]
which leads to:
\[ M_X''(t) = \exp (\lambda (e^{t} - 1)) \left( \lambda e^{t} \right)^2 + \exp (\lambda (e^{t} - 1)) \times \lambda e^{t} \]
At \(t=0\):
\[ E[X^2] = \lambda^2 + \lambda \]
leading to variance:
\[ Var(X) = E[X^2] - (E[X])^2 = \lambda \]
Applications of the Poisson MGF
The MGF of the Poisson distribution is instrumental in a variety of statistical and probabilistic applications.
1. Deriving Moments and Cumulants
The MGF provides a straightforward method for calculating moments and cumulants:- Moments: As shown earlier, derivatives of the MGF at zero yield moments.
- Cumulants: The cumulant generating function (CGF), defined as \(K_X(t) = \log M_X(t)\), encodes cumulants directly:
\[ K_X(t) = \lambda (e^{t} - 1) \]
The \(n\)-th cumulant \(\kappa_n\) is obtained by differentiating \(K_X(t)\):
\[ \kappa_n = \left. \frac{d^n}{dt^n} K_X(t) \right|_{t=0} \]
For the Poisson distribution, all cumulants are equal to \(\lambda\), reflecting the distribution's simplicity.
2. Limit Theorems and Approximate Distributions
The MGF is used in proving limit theorems such as:- Poisson approximation to binomial: Using MGFs, one can show that the binomial distribution tends to a Poisson distribution as \(n \to \infty\) with \(p \to 0\), \(np \to \lambda\).
- Central Limit Theorem (CLT): For large \(\lambda\), the Poisson distribution approximates a normal distribution. The MGF aids in deriving this approximation.
