基本概率分布Basic Concept of Probability Distributions 2: Poisson Distribution
PMF
A discrete random variable $X$ is said to have a Poisson distribution with parameter $\lambda > 0$, if the probability mass function of $X$ is given by $$f(x; \lambda) = \Pr(X=x) = e^{-\lambda}{\lambda^x\over x!}$$ for $x=0, 1, 2, \cdots$.
Proof:
$$ \begin{align*} \sum_{x=0}^{\infty}f(x; \lambda) &= \sum_{x=0}^{\infty} e^{-\lambda}{\lambda^x\over x!}\\ & = e^{-\lambda}\sum_{x=0}^{\infty}{\lambda^x\over x!}\\ &= e^{-\lambda}\left(1 + \lambda + {\lambda^2 \over 2!}+ {\lambda^3\over 3!}+ \cdots\right)\\ & = e^{-\lambda} \cdot e^{\lambda}\\ & = 1 \end{align*} $$
Mean
The expected value is $$\mu = E[X] = \lambda$$
Proof:
$$ \begin{align*} E[X] &= \sum_{x=0}^{\infty}xe^{-\lambda}{\lambda^x\over x!}\\ & = \sum_{x=1}^{\infty}e^{-\lambda}{\lambda^x\over (x-1)!}\\ & =\lambda e^{-\lambda}\sum_{x=1}^{\infty}{\lambda^{x-1}\over (x-1)!}\\ & = \lambda e^{-\lambda}\left(1+\lambda + {\lambda^2\over 2!} + {\lambda^3\over 3!}+\cdots\right)\\ & = \lambda e^{-\lambda} e^{\lambda}\\ & = \lambda \end{align*} $$
Variance
The variance is $$\sigma^2 = \mbox{Var}(X) = \lambda$$
Proof:
$$ \begin{align*} E\left[X^2\right] &= \sum_{x=0}^{\infty}x^2e^{-\lambda}{\lambda^x\over x!}\\ &= \sum_{x=1}^{\infty}xe^{-\lambda}{\lambda^x\over (x-1)!}\\ &= \lambda\sum_{x=1}^{\infty}xe^{-\lambda}{\lambda^{x-1}\over (x-1)!}\\ & = \lambda\sum_{x=1}^{\infty}(x-1+1)e^{-\lambda}{\lambda^{x-1}\over (x-1)!}\\ &= \lambda\left(\sum_{x=1}^{\infty}(x-1)e^{-\lambda}{\lambda^{x-1}\over (x-1)!} + \sum_{x=1}^{\infty} e^{-\lambda}{\lambda^{x-1}\over (x-1)!}\right)\\ &= \lambda\left(\lambda\sum_{x=2}^{\infty}e^{-\lambda}{\lambda^{x-2}\over (x-2)!} + \sum_{x=1}^{\infty} e^{-\lambda}{\lambda^{x-1}\over (x-1)!}\right)\\ & = \lambda(\lambda+1) \end{align*} $$ Hence the variance is $$ \begin{align*} \mbox{Var}(X)& = E\left[X^2\right] - E[X]^2\\ & = \lambda(\lambda + 1) - \lambda^2\\ & = \lambda \end{align*} $$
Examples
1. Let $X$ be Poisson distributed with intensity $\lambda=10$. Determine the expected value $\mu$, the standard deviation $\sigma$, and the probability $P\left(|X-\mu| \geq 2\sigma\right)$. Compare with Chebyshev's Inequality.
Solution:
The Poisson distribution mass function is $$f(x) = e^{-\lambda}{\lambda^x\over x!},\ x=0, 1, 2, \cdots$$ The expected value is $$\mu= \lambda=10$$ Then the standard deviation is $$\sigma = \sqrt{\lambda} = 3.162278$$ The probability that $X$ takes a value more than two standard deviations from $\mu$ is $$ \begin{align*} P\left(|X-\lambda| \geq 2\sqrt{\lambda}\right) &= P\left(X \leq \lambda-2\sqrt{\lambda}\right) + P\left(X \geq \lambda + 2\sqrt{\lambda}\right)\\ & = P(X \leq 3) + P(X \geq 17)\\ & = 0.03737766 \end{align*} $$ R code:
sum(dpois(c(0:3), 10)) + 1 - sum(dpois(c(0:16), 10))
# [1] 0.03737766
Chebyshev's Inequality gives the weaker estimation $$P\left(|X - \mu| \geq 2\sigma\right) \leq {1\over2^2} = 0.25$$
2. In a certain shop, an average of ten customers enter per hour. What is the probability $P$ that at most eight customers enter during a given hour.
Solution:
Recall that the Poisson distribution mass function is $$P(X=x) = e^{-\lambda}{\lambda^x\over x!}$$ and $\lambda=10$. So we have $$ \begin{align*} P(X \leq 8) &= \sum_{x=0}^{8}e^{-10}{10^{x}\over x!}\\ &= 0.3328197 \end{align*} $$ R code:
sum(dpois(c(0:8), 10))
# [1] 0.3328197
ppois(8, 10)
# [1] 0.3328197
3. What is the probability $Q$ that at most 80 customers enter the shop from the previous problem during a day of 10 hours?
Solution:
The number $Y$ of customers during an entire day is the sum of ten independent Poisson distribution with parameter $\lambda=10$. $$Y = X_1 + \cdots + X_{10}$$ Thus $Y$ is also a Poisson distribution with parameter $\lambda = 100$. Thus we have $$ \begin{align*} P(Y \leq 80) &= \sum_{y=0}^{80}e^{-100}{100^{y}\over y!}\\ &= 0.02264918 \end{align*} $$ R code:
sum(dpois(c(0:80), 100))
# [1] 0.02264918
ppois(80, 100)
# [1] 0.02264918
Alternatively, we can use normal approximation (generally when $\lambda > 9$) with $\mu = \lambda = 100$ and $\sigma = \sqrt{\lambda}=10$. $$ \begin{align*} P(Y \leq 80) &= \Phi\left({80.5-100\over 10 }\right)\\ &= \Phi\left({-19.5\over10}\right)\\ &=0.02558806 \end{align*} $$ R code:
pnorm(-19.5/10)
# [1] 0.02558806
4. At the 2006 FIFA World Championship, a total of 64 games were played. The number of goals per game was distributed as follows: 8 games with 0 goals 13 games with 1 goal 18 games with 2 goals 11 games with 3 goals 10 games with 4 goals 2 games with 5 goals 2 games with 6 goals Determine whether the number of goals per game may be assumed to be Poisson distributed.
Solution:
We can use Chi-squared test. The observations are in Table 1.

On the other hand, if this is a Poisson distribution then the parameter should be $$ \begin{align*} \lambda &= \mu\\ & = {0\times8 + 1\times13 +\cdots + 6\times2 \over 8+13+\cdots+2}\\ & = {144\over 64}\\ &=2.25 \end{align*} $$ And the Poisson point probabilities are listed in Table 2.

And hence the expected numbers are listed in Table 3.

Note that we have merged some categories in order to get $E_i \geq 3$. The statistic is $$ \begin{align*} \chi^2 &= \sum{(O-E)^2\over E}\\ &= {(8-6.720)^2 \over 6.720} + \cdots + {(4-4.992)^2 \over 4.992}\\ &= 2.112048 \end{align*} $$ There are six categories and thus the degree of freedom is $6-1 = 5$. The significance probability is 0.8334339. R code:
prob = c(round(dpois(c(0:6), 2.25), 3),
+ 1 - round(sum(dpois(c(0:6), 2.25)), 3))
expect = prob * 64
prob; expect
# [1] 0.105 0.237 0.267 0.200 0.113 0.051 0.019 0.008
# [1] 6.720 15.168 17.088 12.800 7.232 3.264 1.216 0.512
O = c(8, 13, 18, 11, 10, 4)
E = c(expect[1:5], sum(expect[6:8]))
O; E
# [1] 8 13 18 11 10 4
# [1] 6.720 15.168 17.088 12.800 7.232 4.992
chisq = sum((O - E) ^ 2 / E)
1 - pchisq(chisq, 5)
# [1] 0.8334339
The hypothesis is $$H_0: \mbox{Poisson distribution},\ H_1: \mbox{Not Poisson distribution}$$ Since $p = 0.8334339 > 0.05$, so we accept $H_0$. That is, it is reasonable to claim that the number of goals per game is Poisson distributed.
Reference
- Ross, S. (2010). A First Course in Probability (8th Edition). Chapter 4. Pearson. ISBN: 978-0-13-603313-4.
- Brink, D. (2010). Essentials of Statistics: Exercises. Chapter 5 & 9. ISBN: 978-87-7681-409-0.
基本概率分布Basic Concept of Probability Distributions 2: Poisson Distribution的更多相关文章
- 基本概率分布Basic Concept of Probability Distributions 8: Normal Distribution
PDF version PDF & CDF The probability density function is $$f(x; \mu, \sigma) = {1\over\sqrt{2\p ...
- 基本概率分布Basic Concept of Probability Distributions 7: Uniform Distribution
PDF version PDF & CDF The probability density function of the uniform distribution is $$f(x; \al ...
- 基本概率分布Basic Concept of Probability Distributions 6: Exponential Distribution
PDF version PDF & CDF The exponential probability density function (PDF) is $$f(x; \lambda) = \b ...
- 基本概率分布Basic Concept of Probability Distributions 5: Hypergemometric Distribution
PDF version PMF Suppose that a sample of size $n$ is to be chosen randomly (without replacement) fro ...
- 基本概率分布Basic Concept of Probability Distributions 3: Geometric Distribution
PDF version PMF Suppose that independent trials, each having a probability $p$, $0 < p < 1$, o ...
- 基本概率分布Basic Concept of Probability Distributions 1: Binomial Distribution
PDF下载链接 PMF If the random variable $X$ follows the binomial distribution with parameters $n$ and $p$ ...
- 基本概率分布Basic Concept of Probability Distributions 4: Negative Binomial Distribution
PDF version PMF Suppose there is a sequence of independent Bernoulli trials, each trial having two p ...
- PRML Chapter 2. Probability Distributions
PRML Chapter 2. Probability Distributions P68 conjugate priors In Bayesian probability theory, if th ...
- Common Probability Distributions
Common Probability Distributions Probability Distribution A probability distribution describes the p ...
随机推荐
- Spring TestContext测试框架搭建
同样是测试,JUnit和Spring TestContext相比,Spring TestContext优势如下: 1.Spring TestContext可以手动设置测试事务回滚,不破坏数据现场 2. ...
- 创建pathing jar
pathing jar是一个特殊的jar: 该jar文件只包含manifest.mf文件 该manifest文件只包含Class-Path,列出了所有需要真正加到classpath中的jar,或者di ...
- 建立时间和保持时间(setup time 和 hold time)
建立时间和保持时间贯穿了整个时序分析过程.只要涉及到同步时序电路,那么必然有上升沿.下降沿采样,那么无法避免setup-time 和 hold-time这两个概念.本文内容相对独立于该系列其他文章,是 ...
- 更便捷的Android多渠道打包方式
本文先回顾了以往流行的多渠道打包方式,随后引入的mcxiaoke的packer-ng-plugin项目,介绍该项目在实际应用(配合友盟统计)中如何解决更方便的Android多渠道打包问题 多渠道打包方 ...
- Android四大组件之Activity详解——创建和启动Activity
前面我们已经对Activity有过简单的介绍: Android开发——初始Activity Android开发——响应用户事件 Android开发——Activity生命周期 先来看一下最终结果 项目 ...
- 第七章 java基础类库
1. 日期时间: 用Calendar类. 2. 分隔符:空格.tab.回车. 3. Scanner:读取键盘输入.读取文件. 4. 系统类: System Runtime. 5. 所有的java类都 ...
- HTML5基础知识(1)--上标和下标文本
1.上标文本标签:<sup>/<sup> 2.下标文本标签:<sub></sub> 3.案例代码 <!doctype html> <h ...
- 计算机网络-TCP连接
TCP首部20个字节 1.为什么TCP要三次握手建立连接? TCP连接过程,客户端发送请求到服务器,服务器确认请求发送到客户端,客户端再发送确认请求到服务器 原因:简言之,为了防止失效的连接请求发送到 ...
- AndroidPn
客户端的主要包说明 org.androidpn.client包下的文件 public class Constants { //包含静态数据 public class InvalidFormatExc ...
- JavaScript使用自定义事件实现简单的模块化开发
WEB前端最常见驱动方式就是事件了, 所有交互等等都是通过事件,前端的常见事件有: UI事件: 焦点事件: 鼠标事件: 滚轮事件: 文本事件: 键盘事件: 变动事件: 现在网页上有一个输入框, 如果我 ...