二项分布

此词条暂由南风翻译

"Binomial model" redirects here. For the binomial model in options pricing, see Binomial options pricing model.

See also: Negative binomial distribution

-->

-->

{{Probability distribution

{{Probability distribution

{概率分布

 | name       = Binomial distribution

 | name       = Binomial distribution

二项分布

 | type       = mass

 | type       = mass

类型 = 质量

 | pdf_image  = Probability mass function for the binomial distribution

 | pdf_image  = Probability mass function for the binomial distribution

2012年3月24日 | pdf 图片 = 概率质量函数二项分布

 | cdf_image  = Cumulative distribution function for the binomial distribution

 | cdf_image  = Cumulative distribution function for the binomial distribution

2012年3月24日 | cdf 图像 = 累积分布函数二项分布

 | notation   = [math]\displaystyle{ B(n,p) }[/math]

 | notation   = B(n,p)

| 符号 = b (n，p)

 | parameters = [math]\displaystyle{ n \in \{0, 1, 2, \ldots\} }[/math] – number of trials
[math]\displaystyle{ p \in [0,1] }[/math] – success probability for each trial
[math]\displaystyle{ q = 1 - p }[/math]

 | parameters = n \in \{0, 1, 2, \ldots\} – number of trials
p \in [0,1] – success probability for each trial
q = 1 - p

| 参数 = n in {0,1,2，ldots } -- 试验次数 < br/> p in [0,1] -- 每个试验的成功概率 < br/> q = 1-p

 | support    = [math]\displaystyle{ k \in \{0, 1, \ldots, n\} }[/math] – number of successes

 | support    = k \in \{0, 1, \ldots, n\} – number of successes

| support = k in {0,1，ldots，n }——成功的数量

 | pdf        = [math]\displaystyle{ \binom{n}{k} p^k q^{n-k} }[/math]

 | pdf        = \binom{n}{k} p^k q^{n-k}

| pdf = [math]\binom{n}{k} p^k q^{n-k}[/math]

 | cdf        = [math]\displaystyle{ I_{q}(n - k, 1 + k) }[/math]

 | cdf        = I_{q}(n - k, 1 + k)

| cdf = i _ { q }(n-k，1 + k)

 | mean       = [math]\displaystyle{ np }[/math]

 | mean       = np

平均值 = np

 | median     = [math]\displaystyle{ \lfloor np \rfloor }[/math] or [math]\displaystyle{ \lceil np \rceil }[/math]

 | median     = \lfloor np \rfloor or \lceil np \rceil

中位数 = lfloor np rfloor 或 lceil np rceil

 | mode       = [math]\displaystyle{ \lfloor (n + 1)p \rfloor }[/math] or [math]\displaystyle{ \lceil (n + 1)p \rceil - 1 }[/math]

 | mode       = \lfloor (n + 1)p \rfloor or \lceil (n + 1)p \rceil - 1

| 模 = lfloor (n + 1) p rfloor 或 lceil (n + 1) p rceil-1

 | variance   = [math]\displaystyle{ npq }[/math]

 | variance   = npq

| 方差 = npq

 | skewness   = [math]\displaystyle{ \frac{q-p}{\sqrt{npq}} }[/math]

 | skewness   = \frac{q-p}{\sqrt{npq}}

| 偏度 = frac { q-p }{ sqrt { npq }}

 | kurtosis   = [math]\displaystyle{ \frac{1-6pq}{npq} }[/math]

 | kurtosis   = \frac{1-6pq}{npq}

| 峰度 = frac {1-6pq }{ npq }

 | entropy    = [math]\displaystyle{ \frac{1}{2} \log_2 (2\pi enpq) + O \left( \frac{1}{n} \right) }[/math]
 in shannons. For nats, use the natural log in the log.

 | entropy    = \frac{1}{2} \log_2 (2\pi enpq) + O \left( \frac{1}{n} \right)
 in shannons. For nats, use the natural log in the log.

| 熵 = frac {1}{2} log _ 2(2 pi enpq) + o left (frac {1}{ n } right) < br/> in shannons。对于 nats，使用原木中的自然原木。

 | mgf        = [math]\displaystyle{ (q + pe^t)^n }[/math]

 | mgf        = (q + pe^t)^n

| mgf = (q + pe ^ t) ^ n

 | char       = [math]\displaystyle{ (q + pe^{it})^n }[/math]

 | char       = (q + pe^{it})^n

| char = (q + pe ^ { it }) ^ n

 | pgf        = [math]\displaystyle{ G(z) = [q + pz]^n }[/math]

 | pgf        = G(z) = [q + pz]^n

| pgf = g (z) = [ q + pz ] ^ n

 | fisher     = [math]\displaystyle{  g_n(p) = \frac{n}{pq}  }[/math]
(for fixed [math]\displaystyle{ n }[/math])

 | fisher     =  g_n(p) = \frac{n}{pq} 
(for fixed n)

| fisher = g _ n (p) = frac { n }{ pq } < br/> (对于固定 n)

}}

}}

}}

文件:Pascal's triangle; binomial distribution.svg

Binomial distribution for [math]\displaystyle{ p=0.5 }[/math]
with n and k as in Pascal's triangle

The probability that a ball in a Galton box with 8 layers (n = 8) ends up in the central bin (k = 4) is [math]\displaystyle{ 70/256 }[/math].

Binomial distribution for p=0.5
with n and k as in [[Pascal's triangle

The probability that a ball in a Galton box with 8 layers (n = 8) ends up in the central bin (k = 4) is 70/256.]]

在[帕斯卡三角形 < br/> < br/> < br/> 中，p = 0.5 < br/> 与 n 和 k 相关的二项分布为[[帕斯卡三角形 < br/> < br/> < br/> 一个8层的高尔顿盒子中的球最终进入中央箱子(k = 4)的概率是70/256]

In probability theory and statistics, the binomial distribution with parameters n and p is the discrete probability distribution of the number of successes in a sequence of n independent experiments, each asking a yes–no question, and each with its own boolean-valued outcome: success/yes/true/one (with probability p) or failure/no/false/zero (with probability q = 1 − p).

In probability theory and statistics, the binomial distribution with parameters n and p is the discrete probability distribution of the number of successes in a sequence of n independent experiments, each asking a yes–no question, and each with its own boolean-valued outcome: success/yes/true/one (with probability p) or failure/no/false/zero (with probability q = 1 − p).

在概率论和统计学中，参数为 n 和 p 的二项分布是 n 个独立实验序列中成功次数的离散概率分布，每个实验询问一个 是-否 问题，每个实验都有自己的布尔值结果: 成功/是/正确/一 (概率为 p)或 失败/否/错误/零 (概率为 q = 1-p)。

A single success/failure experiment is also called a Bernoulli trial or Bernoulli experiment and a sequence of outcomes is called a Bernoulli process; for a single trial, i.e., n = 1, the binomial distribution is a Bernoulli distribution. The binomial distribution is the basis for the popular binomial test of statistical significance.

A single success/failure experiment is also called a Bernoulli trial or Bernoulli experiment and a sequence of outcomes is called a Bernoulli process; for a single trial, i.e., n = 1, the binomial distribution is a Bernoulli distribution. The binomial distribution is the basis for the popular binomial test of statistical significance.

一个单一的结果为成功/失败的实验也被称为'伯努利试验或伯努利实验，一系列伯努利实验结果被称为伯努利过程; 对于一个单一的实验，例如，n = 1，这个二项分布是一个伯努利分布。二项分布是流行统计显著性'二项检验的基础。

The binomial distribution is frequently used to model the number of successes in a sample of size n drawn with replacement from a population of size N. If the sampling is carried out without replacement, the draws are not independent and so the resulting distribution is a hypergeometric distribution, not a binomial one. However, for N much larger than n, the binomial distribution remains a good approximation, and is widely used.

The binomial distribution is frequently used to model the number of successes in a sample of size n drawn with replacement from a population of size N. If the sampling is carried out without replacement, the draws are not independent and so the resulting distribution is a hypergeometric distribution, not a binomial one. However, for N much larger than n, the binomial distribution remains a good approximation, and is widely used.

二项分布经常被用来模拟大小为 n 的样本中的成功数量，这些样本是用 大小为N的种群中的替代物抽取的。如果抽样没有更换，抽样就不是独立的，所以得到的分布是超几何分布，而不是二项分布。然而，对于 N 比 n 大得多的情况，二项分布仍然是一个很好的近似值，并且被广泛使用。

Definitions

Probability mass function

概率质量函数

In general, if the random variable X follows the binomial distribution with parameters n ∈ ℕ and p ∈ [0,1], we write X ~ B(n, p). The probability of getting exactly k successes in n independent Bernoulli trials is given by the probability mass function:

In general, if the random variable X follows the binomial distribution with parameters n ∈ ℕ and p ∈ [0,1], we write X ~ B(n, p). The probability of getting exactly k successes in n independent Bernoulli trials is given by the probability mass function:

一般来说，如果随机变量 x 服从参数 n ∈ N 和 p ∈[0,1]的二项分布，我们写作 x ~ b (n，p)。在 n 个独立的伯努利试验中获得 k 成功的概率是由概率质量函数给出的:

[math]\displaystyle{ f(k,n,p) = \Pr(k;n,p) = \Pr(X = k) = \binom{n}{k}p^k(1-p)^{n-k} }[/math]

f(k,n,p) = \Pr(k;n,p) = \Pr(X = k) = \binom{n}{k}p^k(1-p)^{n-k}

F (k，n，p) = Pr (k; n，p) = Pr (x = k) = binom { n }{ k } p ^ k (1-p) ^ { n-k }

for k = 0, 1, 2, ..., n, where

for k = 0, 1, 2, ..., n, where

对于 k = 0,1,2，... ，n，其中

[math]\displaystyle{ \binom{n}{k} =\frac{n!}{k!(n-k)!} }[/math]

\binom{n}{k} =\frac{n!}{k!(n-k)!}

(n-k)

is the binomial coefficient, hence the name of the distribution. The formula can be understood as follows. k successes occur with probability p^k and n − k failures occur with probability (1 − p)^n − k. However, the k successes can occur anywhere among the n trials, and there are [math]\displaystyle{ \binom{n}{k} }[/math] different ways of distributing k successes in a sequence of n trials.

is the binomial coefficient, hence the name of the distribution. The formula can be understood as follows. k successes occur with probability pk and n − k failures occur with probability (1 − p)n − k. However, the k successes can occur anywhere among the n trials, and there are \binom{n}{k} different ways of distributing k successes in a sequence of n trials.

是二项式系数，因而得名。这个公式可以理解为。K次成功发生在概率为 pk 的情况下， n-k 次失败发生在概率为(1-p) n-k 的情况下。然而，k 次成功可以发生在 n 个试验中的任何地方，并且在 n 个试验序列中有不同的 k 次成功的分配方法。

In creating reference tables for binomial distribution probability, usually the table is filled in up to n/2 values. This is because for k > n/2, the probability can be calculated by its complement as

In creating reference tables for binomial distribution probability, usually the table is filled in up to n/2 values. This is because for k > n/2, the probability can be calculated by its complement as

在为二项分布概率创建参考表时，通常表中最多填充到 n/2的值。这是因为对于 k > n/2，概率可以通过它的补来计算

[math]\displaystyle{ f(k,n,p)=f(n-k,n,1-p). }[/math]

f(k,n,p)=f(n-k,n,1-p).

F (k，n，p) = f (n-k，n，1-p).

Looking at the expression f(k, n, p) as a function of k, there is a k value that maximizes it. This k value can be found by calculating

Looking at the expression f(k, n, p) as a function of k, there is a k value that maximizes it. This k value can be found by calculating

把表达式 f (k，n，p)看作 k 的函数，有一个 k 值使它最大化。这个 k 值可以通过计算找到

[math]\displaystyle{ \frac{f(k+1,n,p)}{f(k,n,p)}=\frac{(n-k)p}{(k+1)(1-p)} }[/math]

\frac{f(k+1,n,p)}{f(k,n,p)}=\frac{(n-k)p}{(k+1)(1-p)} 

Frac { f (k + 1，n，p)}{ f (k，n，p)} = frac {(n-k) p }{(k + 1)(1-p)}

and comparing it to 1. There is always an integer M that satisfies

and comparing it to 1. There is always an integer M that satisfies

并与1相比较。总有一个整数 M 满足

[math]\displaystyle{ (n+1)p-1 \leq M \lt (n+1)p. }[/math]

(n+1)p-1 \leq M < (n+1)p.

(n + 1) p-1 leq m < (n + 1) p.

f(k, n, p) is monotone increasing for k < M and monotone decreasing for k > M, with the exception of the case where (n + 1)p is an integer. In this case, there are two values for which f is maximal: (n + 1)p and (n + 1)p − 1. M is the most probable outcome (that is, the most likely, although this can still be unlikely overall) of the Bernoulli trials and is called the mode.

f(k, n, p) is monotone increasing for k < M and monotone decreasing for k > M, with the exception of the case where (n + 1)p is an integer. In this case, there are two values for which f is maximal: (n + 1)p and (n + 1)p − 1. M is the most probable outcome (that is, the most likely, although this can still be unlikely overall) of the Bernoulli trials and is called the mode.

F (k，n，p)对 k < m 是单调递增的，对 k > m 是单调递减的，但(n + 1) p 是整数的情况除外。在这种情况下，有两个值使 f 是最大的: (n + 1) p 和(n + 1) p-1。M 是伯努利试验最有可能的结果(也就是说，最有可能的结果，尽管总的来说仍然存在不发生的情况) ，被称为模。

Example

Suppose a biased coin comes up heads with probability 0.3 when tossed. The probability of seeing exactly 4 heads in 6 tosses is

Suppose a biased coin comes up heads with probability 0.3 when tossed. The probability of seeing exactly 4 heads in 6 tosses is

假设抛出一枚有偏硬币时，正面朝上的概率为0.3。在6次抛掷中正好看到4个正面的概率是

[math]\displaystyle{ f(4,6,0.3) = \binom{6}{4}0.3^4 (1-0.3)^{6-4}= 0.059535. }[/math]

f(4,6,0.3) = \binom{6}{4}0.3^4 (1-0.3)^{6-4}= 0.059535.

F (4,6,0.3) = binom {6}{4}0.3 ^ 4(1-0.3) ^ {6-4} = 0.059535.

Cumulative distribution function

累积分布函数

The cumulative distribution function can be expressed as:

The cumulative distribution function can be expressed as:

累积分布函数可以表达为:

[math]\displaystyle{ F(k;n,p) = \Pr(X \le k) = \sum_{i=0}^{\lfloor k \rfloor} {n\choose i}p^i(1-p)^{n-i}, }[/math]

F(k;n,p) = \Pr(X \le k) = \sum_{i=0}^{\lfloor k \rfloor} {n\choose i}p^i(1-p)^{n-i},

F (k; n，p) = Pr (x le k) = sum _ { i = 0} ^ { lfloor k rfloor }{ n choose i } p ^ i (1-p) ^ { n-i } ,

where [math]\displaystyle{ \lfloor k\rfloor }[/math] is the "floor" under k, i.e. the greatest integer less than or equal to k.

where \lfloor k\rfloor is the "floor" under k, i.e. the greatest integer less than or equal to k.

是 k 下面的”楼层” ，也就是。小于或等于 k 的最大整数。

It can also be represented in terms of the regularized incomplete beta function, as follows:

It can also be represented in terms of the regularized incomplete beta function, as follows:

它也可以用正则化不完全 beta 函数来表示，如下:

[math]\displaystyle{ \begin{align} \lt math\gt \begin{align} 1.1.1.2.2.2.2.2.2.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.4.3.3.3.3.3.3.3.3.3.3.3.4.3.3.3.3.3.3.3.3.3.3 F(k;n,p) & = \Pr(X \le k) \\ F(k;n,p) & = \Pr(X \le k) \\ F (k; n，p) & = Pr (x le k) &= I_{1-p}(n-k, k+1) \\ &= I_{1-p}(n-k, k+1) \\ & = i _ {1-p }(n-k，k + 1) & = (n-k) {n \choose k} \int_0^{1-p} t^{n-k-1} (1-t)^k \, dt. & = (n-k) {n \choose k} \int_0^{1-p} t^{n-k-1} (1-t)^k \, dt. & = (n-k){ n choose k } int _ 0 ^ {1-p } t ^ { n-k-1}(1-t) ^ k，dt. \end{align} }[/math]

\end{align}</math>

结束{ align } </math >

which is equivalent to the cumulative distribution function of the F-distribution:

which is equivalent to the cumulative distribution function of the -distribution:

这相当于分布的累积分布函数:

[math]\displaystyle{ F(k;n,p) = F_{F\text{-distribution}}\left(x=\frac{1-p}{p}\frac{k+1}{n-k};d_1=2(n-k),d_2=2(k+1)\right). }[/math]

F(k;n,p) = F_{F\text{-distribution}}\left(x=\frac{1-p}{p}\frac{k+1}{n-k};d_1=2(n-k),d_2=2(k+1)\right).

F (k; n，p) = f _ { f text {-distribution }}左(x = frac {1-p }{ p } frac { k + 1}{ n-k } ; d _ 1 = 2(n-k) ，d _ 2 = 2(k + 1)右)。

Some closed-form bounds for the cumulative distribution function are given below.

Some closed-form bounds for the cumulative distribution function are given below.

下面给出了累积分布函数的一些闭式界。

Properties

Expected value and variance

期望值和方差

If X ~ B(n, p), that is, X is a binomially distributed random variable, n being the total number of experiments and p the probability of each experiment yielding a successful result, then the expected value of X is:

If X ~ B(n, p), that is, X is a binomially distributed random variable, n being the total number of experiments and p the probability of each experiment yielding a successful result, then the expected value of X is:

如果 x ~ b (n，p) ，即 x 是一个服从二项分布的随机变量，n 是实验的总数，p 是每个实验产生成功结果的概率，那么 x 的期望值是:

[math]\displaystyle{ \operatorname{E}[X] = np. }[/math]

\operatorname{E}[X] = np.

操作员名称{ e }[ x ] = np。

This follows from the linearity of the expected value along with fact that X is the sum of n identical Bernoulli random variables, each with expected value p. In other words, if [math]\displaystyle{ X_1, \ldots, X_n }[/math] are identical (and independent) Bernoulli random variables with parameter p, then [math]\displaystyle{ X = X_1 + \cdots + X_n }[/math] and

This follows from the linearity of the expected value along with fact that is the sum of identical Bernoulli random variables, each with expected value . In other words, if X_1, \ldots, X_n are identical (and independent) Bernoulli random variables with parameter , then X = X_1 + \cdots + X_n and

这是由于两随机变量线性组合的期望值实际上是两个独立的伯努利随机变量的期望的线性组合。换句话说，如果 x1，ldots，xn 是独立的伯努利随机变量，那么 x = x1 + cdots + xn

[math]\displaystyle{ \operatorname{E}[X] = \operatorname{E}[X_1 + \cdots + X_n] = \operatorname{E}[X_1] + \cdots + \operatorname{E}[X_n] = p + \cdots + p = np. }[/math]

\operatorname{E}[X] = \operatorname{E}[X_1 + \cdots + X_n] = \operatorname{E}[X_1] + \cdots + \operatorname{E}[X_n] = p + \cdots + p = np.

操作员名称{ e }[ x ] = 操作员名称{ e }[ x _ 1 + 圆点 + x _ n ] = 操作员名称{ e }[ x _ 1] + 圆点 + 操作员名称{ e }[ x _ n ] = p + 圆点 + p = np。

The variance is:

The variance is:

方差是:

[math]\displaystyle{ \operatorname{Var}(X) = np(1 - p). }[/math]

\operatorname{Var}(X) = np(1 - p).

操作符名称{ Var }(x) = np (1-p)。

This similarly follows from the fact that the variance of a sum of independent random variables is the sum of the variances.

This similarly follows from the fact that the variance of a sum of independent random variables is the sum of the variances.

这同样也是从这样一个事实出发: 独立随机变量之和的方差是方差之和。

Higher moments

高阶矩

The first 6 central moments are given by

The first 6 central moments are given by

前6个中心矩由

[math]\displaystyle{ \begin{align} \lt math\gt \begin{align} 1.1.1.2.2.2.2.2.2.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.4.3.3.3.3.3.3.3.3 \mu_1 &= 0, \\ \mu_1 &= 0, \\ 1 & = 0, \mu_2 &= np(1-p),\\ \mu_2 &= np(1-p),\\ mu _ 2 & = np (1-p) , \mu_3 &= np(1-p)(1-2p),\\ \mu_3 &= np(1-p)(1-2p),\\ mu _ 3 & = np (1-p)(1-2p) , \mu_4 &= np(1-p)(1+(3n-6)p(1-p)),\\ \mu_4 &= np(1-p)(1+(3n-6)p(1-p)),\\ mu _ 4 & = np (1-p)(1 + (3n-6) p (1-p)) , \mu_5 &= np(1-p)(1-2p)(1+(10n-12)p(1-p)),\\ \mu_5 &= np(1-p)(1-2p)(1+(10n-12)p(1-p)),\\ mu _ 5 & = np (1-p)(1-2p)(1 + (10n-12) p (1-p)) , \mu_6 &= np(1-p)(1-30p(1-p)(1-4p(1-p))+5np(1-p)(5-26p(1-p))+15n^2 p^2 (1-p)^2). \mu_6 &= np(1-p)(1-30p(1-p)(1-4p(1-p))+5np(1-p)(5-26p(1-p))+15n^2 p^2 (1-p)^2). mu _ 6 & = np (1-p)(1-30p (1-p)(1-4p (1-p)) + 5 np (1-p)(5-26p (1-p)) + 15 n ^ 2 p ^ 2(1-p) ^ 2). \end{align} }[/math]

\end{align}</math>

结束{ align } </math >

Mode

模

Usually the mode of a binomial B(n, p) distribution is equal to [math]\displaystyle{ \lfloor (n+1)p\rfloor }[/math], where [math]\displaystyle{ \lfloor\cdot\rfloor }[/math] is the floor function. However, when (n + 1)p is an integer and p is neither 0 nor 1, then the distribution has two modes: (n + 1)p and (n + 1)p − 1. When p is equal to 0 or 1, the mode will be 0 and n correspondingly. These cases can be summarized as follows:

Usually the mode of a binomial B(n, p) distribution is equal to \lfloor (n+1)p\rfloor, where \lfloor\cdot\rfloor is the floor function. However, when (n + 1)p is an integer and p is neither 0 nor 1, then the distribution has two modes: (n + 1)p and (n + 1)p − 1. When p is equal to 0 or 1, the mode will be 0 and n correspondingly. These cases can be summarized as follows:

通常二项式 b (n，p)分布的模等于 lfloor (n + 1) p 楼层，其中 lfloor cdot 楼层是下限函数。然而，当(n + 1) p 是整数且 p 既不是0也不是1时，分布有两种模: (n + 1) p 和(n + 1) p-1。当 p 等于0或1时，模将相应地为0和 n。这些情况可概述如下:

[math]\displaystyle{ \text{mode} = \lt math\gt \text{mode} = 1.1.1.2.1 \begin{cases} \begin{cases} 开始{ cases } \lfloor (n+1)\,p\rfloor & \text{if }(n+1)p\text{ is 0 or a noninteger}, \\ \lfloor (n+1)\,p\rfloor & \text{if }(n+1)p\text{ is 0 or a noninteger}, \\ 文本{ if }(n + 1) p text { is 0 or a noninteger } , (n+1)\,p\ \text{ and }\ (n+1)\,p - 1 &\text{if }(n+1)p\in\{1,\dots,n\}, \\ (n+1)\,p\ \text{ and }\ (n+1)\,p - 1 &\text{if }(n+1)p\in\{1,\dots,n\}, \\ (n + 1) ，p text { and }(n + 1) ，p-1 & text { if }(n + 1) p in {1，dots，n } , n & \text{if }(n+1)p = n + 1. n & \text{if }(n+1)p = n + 1. n & text { if }(n + 1) p = n + 1. \end{cases} }[/math]

     \end{cases}</math>

结束{ cases } </math >

Proof: Let

Proof: Let

证明: 让

[math]\displaystyle{ f(k)=\binom nk p^k q^{n-k}. }[/math]

f(k)=\binom nk p^k q^{n-k}.

F (k) = binom nk p ^ k q ^ { n-k }.

For [math]\displaystyle{ p=0 }[/math] only [math]\displaystyle{ f(0) }[/math] has a nonzero value with [math]\displaystyle{ f(0)=1 }[/math]. For [math]\displaystyle{ p=1 }[/math] we find [math]\displaystyle{ f(n)=1 }[/math] and [math]\displaystyle{ f(k)=0 }[/math] for [math]\displaystyle{ k\neq n }[/math]. This proves that the mode is 0 for [math]\displaystyle{ p=0 }[/math] and [math]\displaystyle{ n }[/math] for [math]\displaystyle{ p=1 }[/math].

For p=0 only f(0) has a nonzero value with f(0)=1. For p=1 we find f(n)=1 and f(k)=0 for k\neq n. This proves that the mode is 0 for p=0 and n for p=1.

对于 p = 0，只有 f (0)有一个非零值，f (0) = 1。对于 p = 1，我们发现 f (n) = 1，对于 k neq n， f (k) = 0。这证明了 p = 0时模为0，p = 1时模为 n。

Let [math]\displaystyle{ 0 \lt p \lt 1 }[/math]. We find

Let 0 < p < 1. We find

让0 < p < 1。我们发现

[math]\displaystyle{ \frac{f(k+1)}{f(k)} = \frac{(n-k)p}{(k+1)(1-p)} }[/math].

\frac{f(k+1)}{f(k)} = \frac{(n-k)p}{(k+1)(1-p)}.

Frac { f (k + 1)}{ f (k)} = frac {(n-k) p }{(k + 1)(1-p)}.

From this follows

From this follows

由此可见

[math]\displaystyle{ \begin{align} \lt math\gt \begin{align} 1.1.1.2.2.2.2.2.2.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.4.3.3 k \gt (n+1)p-1 \Rightarrow f(k+1) \lt f(k) \\ k \gt (n+1)p-1 \Rightarrow f(k+1) \lt f(k) \\ K \gt (n + 1) p-1 right tarrow f (k + 1) \lt f (k) k = (n+1)p-1 \Rightarrow f(k+1) = f(k) \\ k = (n+1)p-1 \Rightarrow f(k+1) = f(k) \\ K = (n + 1) p-1 right tarrow f (k + 1) = f (k) k \lt (n+1)p-1 \Rightarrow f(k+1) \gt f(k) k \lt (n+1)p-1 \Rightarrow f(k+1) \gt f(k) K \lt (n + 1) p-1 right tarrow f (k + 1) \gt f (k) \end{align} }[/math]

\end{align}</math>

结束{ align } </math >

So when [math]\displaystyle{ (n+1)p-1 }[/math] is an integer, then [math]\displaystyle{ (n+1)p-1 }[/math] and [math]\displaystyle{ (n+1)p }[/math] is a mode. In the case that [math]\displaystyle{ (n+1)p-1\notin \Z }[/math], then only [math]\displaystyle{ \lfloor (n+1)p-1\rfloor+1=\lfloor (n+1)p\rfloor }[/math] is a mode.

So when (n+1)p-1 is an integer, then (n+1)p-1 and (n+1)p is a mode. In the case that (n+1)p-1\notin \Z, then only \lfloor (n+1)p-1\rfloor+1=\lfloor (n+1)p\rfloor is a mode.

所以当(n + 1) p-1是一个整数时，(n + 1) p-1和(n + 1) p 是一个模。在(n + 1) p-1 notin z 的情况下，只有 lfloor (n + 1) p-1楼 + 1 = lfloor (n + 1) p-1楼是模。

Median

中位数

In general, there is no single formula to find the median for a binomial distribution, and it may even be non-unique. However several special results have been established:

In general, there is no single formula to find the median for a binomial distribution, and it may even be non-unique. However several special results have been established:

一般来说，没有单一的公式可以找到一个二项分布的中位数，甚至可能是非唯一的。然而，已经确立了若干特别成果:

• If np is an integer, then the mean, median, and mode coincide and equal np.

如果“np”是一个整数，那么它的均值，中位数和模相同且等于“np”。

• Any median m must lie within the interval ⌊np⌋ ≤ m ≤ ⌈np⌉.

任何中位数“ m”都必须在⌊np⌋≤≤m≤⌈np⌉范围内。

• A median m cannot lie too far away from the mean: |m − np| ≤ min{ ln 2, max{p, 1 − p} }.

F(k;n,p) \geq \frac{1}{\sqrt{8n\tfrac{k}{n}(1-\tfrac{k}{n})}} \exp\left(-nD\left(\frac{k}{n}\parallel p\right)\right),

F (k; n，p) geq frac {1}{ sqrt {8n tfrac { k }{ n }(1-tfrac { k }{ n })} exp left (- nD left (frac { k }{ n } parallel p right)) ,

• The median is unique and equal to m = round(np) when |m − np| ≤ min{p, 1 − p} (except for the case when p = 模板:Sfrac and n is odd).

中位数是唯一的并且等于“m”

which implies the simpler but looser bound

这意味着更简单但更松散的界限

• When p = 1/2 and n is odd, any number m in the interval 模板:Sfrac(n − 1) ≤ m ≤ 模板:Sfrac(n + 1) is a median of the binomial distribution. If p = 1/2 and n is even, then m = n/2 is the unique median.

F(k;n,p) \geq \frac1{\sqrt{2n}} \exp\left(-nD\left(\frac{k}{n}\parallel p\right)\right).

F (k; n，p) geq frac1{ sqrt {2n } exp left (- nD left (frac { k }{ n } parallel p right))).

For p = 1/2 and k ≥ 3n/8 for even n, it is possible to make the denominator constant:

对于 p = 1/2且 k ≥3n/8且n为偶数时，可以使分母为常数:

Tail bounds

尾部边界

For k ≤ np, upper bounds can be derived for the lower tail of the cumulative distribution function [math]\displaystyle{ F(k;n,p) = \Pr(X \le k) }[/math], the probability that there are at most k successes. Since [math]\displaystyle{ \Pr(X \ge k) = F(n-k;n,1-p) }[/math], these bounds can also be seen as bounds for the upper tail of the cumulative distribution function for k ≥ np.

对于k≤np，可以得出累积分布函数下尾的上界[math]\displaystyle{ F(k;n,p)=Pr(X \le k) }[/math]，即最多存在k成功的概率。由于[math]\displaystyle{ /Pr(X \ge k) = F(n-k;n,1-p) }[/math]，这些界限也可以看作是k≥np的累积分布函数上尾的界限。

F(k;n,\tfrac{1}{2}) \geq \frac{1}{15} \exp\left(- 16n \left(\frac{1}{2} -\frac{k}{n}\right)^2\right). \!

F (k; n，tfrac {1}{2}) geq frac {1}{15} exp left (- 16n left (frac {1}{2}-frac { k }{ n }右) ^ 2 right)。\!

Hoeffding's inequality yields the simple bound

Hoeffding's不等式得到简单的边界

[math]\displaystyle{ F(k;n,p) \leq \exp\left(-2 n\left(p-\frac{k}{n}\right)^2\right), \! }[/math]

which is however not very tight. In particular, for p = 1, we have that F(k;n,p) = 0 (for fixed k, n with k < n), but Hoeffding's bound evaluates to a positive constant.

然而，这并不是很严格。特别是，对于p=1，我们有F(k;n，p)=0(对于固定的k，n与k < n)，但Hoeffding的约束评价为一个正常数。

When n is known, the parameter p can be estimated using the proportion of successes: \widehat{p} = \frac{x}{n}. This estimator is found using maximum likelihood estimator and also the method of moments. This estimator is unbiased and uniformly with minimum variance, proven using Lehmann–Scheffé theorem, since it is based on a minimal sufficient and complete statistic (i.e.: x). It is also consistent both in probability and in MSE.

当 n 已知时，参数 p 可以使用成功的比例来估计: widehat { p } = frac { x }{ n }。利用极大似然估计和矩方法求出了该估计量。利用 Lehmann-scheffé 定理证明了该估计量的无偏一致最小方差，因为该估计量是基于一个极小充分完全统计量(即:。: x).它在概率和均方误差方面也是一致的。

A sharper bound can be obtained from the Chernoff bound:

可以从Chernoff界中得到一个更清晰的边界

A closed form Bayes estimator for p also exists when using the Beta distribution as a conjugate prior distribution. When using a general \operatorname{Beta}(\alpha, \beta) as a prior, the posterior mean estimator is: \widehat{p_b} = \frac{x+\alpha}{n+\alpha+\beta}. The Bayes estimator is asymptotically efficient and as the sample size approaches infinity (n → ∞), it approaches the MLE solution. The Bayes estimator is biased (how much depends on the priors), admissible and consistent in probability.

利用 beta分布作为共轭先验分布时，也存在p的封闭形式 Bayes 估计。当使用一个通用算子名{ Beta }(alpha，Beta)作为先验时，后验平均估计量为: widehat { p _ b } = frac { x + alpha }{ n + alpha + Beta }。贝叶斯估计是渐近有效的，当样本容量接近无穷大(n →∞)时，它逼近最大似然估计解。贝叶斯估计是有偏的(多少取决于先验) ，可接受且一致的概率。

[math]\displaystyle{ F(k;n,p) \leq \exp\left(-nD\left(\frac{k}{n}\parallel p\right)\right) }[/math]

For the special case of using the standard uniform distribution as a non-informative prior (\operatorname{Beta}(\alpha=1, \beta=1) = U(0,1)), the posterior mean estimator becomes \widehat{p_b} = \frac{x+1}{n+2} (a posterior mode should just lead to the standard estimator). This method is called the rule of succession, which was introduced in the 18th century by Pierre-Simon Laplace.

对于使用标准均匀分布作为先验概率的特殊情况(操作者名{ Beta }(alpha = 1，Beta = 1) = u (0,1)) ，后验均值估计变为广义{ p _ b } = frac { x + 1}{ n + 2}(后验模式应该只导致标准估计)。这种方法被称为继承法则，它是在18世纪由皮埃尔-西蒙·拉普拉斯引进的。

where D(a || p) is the relative entropy between an a-coin and a p-coin (i.e. between the Bernoulli(a) and Bernoulli(p) distribution):

When estimating p with very rare events and a small n (e.g.: if x=0), then using the standard estimator leads to \widehat{p} = 0, which sometimes is unrealistic and undesirable. In such cases there are various alternative estimators. One way is to use the Bayes estimator, leading to: \widehat{p_b} = \frac{1}{n+2}). Another method is to use the upper bound of the confidence interval obtained using the rule of three: \widehat{p_{\text{rule of 3}}} = \frac{3}{n})

在估计具有非常罕见事件和小 n (例如，n)的 p 时。: 如果 x = 0) ，那么使用标准估计器会导致广义{ p } = 0，这有时是不现实的，也是不受欢迎的。在这种情况下，有各种可供选择的估计值。一种方法是使用 Bayes 估计，导致: widehat { p _ b } = frac {1}{ n + 2})。另一种方法是使用使用3个规则获得的置信区间的上界: widehat { p { text { rule of 3}}}} = frac {3}{ n })

[math]\displaystyle{ D(a\parallel p)=(a)\log\frac{a}{p}+(1-a)\log\frac{1-a}{1-p}. \! }[/math]

Asymptotically, this bound is reasonably tight; see for details.

渐进地讲，这个边界是相当严格的；详见。

Even for quite large values of n, the actual distribution of the mean is significantly nonnormal. Because of this problem several methods to estimate confidence intervals have been proposed.

即使对于非常大的 n 值，均值的实际分布也是非正态的。针对这一问题，提出了几种估计置信区间的方法。

One can also obtain lower bounds on the tail [math]\displaystyle{ F(k;n,p) }[/math], known as anti-concentration bounds. By approximating the binomial coefficient with Stirling's formula it can be shown that

我们还可以得到尾部[math]\displaystyle{ F(k;n,p) }[/math]的下'界，即反集中界。通过用斯特林公式对二项式系数进行近似，可以看出：[math]\displaystyle{ F(k;n,p) }[/math]是一个反集中的界限。

[math]\displaystyle{ F(k;n,p) \geq \frac{1}{\sqrt{8n\tfrac{k}{n}(1-\tfrac{k}{n})}} \exp\left(-nD\left(\frac{k}{n}\parallel p\right)\right), }[/math]

In the equations for confidence intervals below, the variables have the following meaning:

在下面的置信区间等式中，这些变量具有以下含义:

which implies the simpler but looser bound

这意味着更简单但更松散的约束。

[math]\displaystyle{ F(k;n,p) \geq \frac1{\sqrt{2n}} \exp\left(-nD\left(\frac{k}{n}\parallel p\right)\right). }[/math]

For p = 1/2 and k ≥ 3n/8 for even n, it is possible to make the denominator constant:

[math]\displaystyle{ F(k;n,\tfrac{1}{2}) \geq \frac{1}{15} \exp\left(- 16n \left(\frac{1}{2} -\frac{k}{n}\right)^2\right). \! }[/math]

 \widehat{p\,} \pm z \sqrt{ \frac{ \widehat{p\,} ( 1 -\widehat{p\,} )}{ n } } .

1-widehat { p，})}{ n }.

Statistical Inference

统计推断

A continuity correction of 0.5/n may be added.

可以加上0.5/n 的连续校正。

Estimation of parameters

参数估计

beta分布 贝叶斯推断

When n is known, the parameter p can be estimated using the proportion of successes: [math]\displaystyle{ \widehat{p} = \frac{x}{n}. }[/math] This estimator is found using maximum likelihood estimator and also the method of moments. This estimator is unbiased and uniformly with minimum variance, proven using Lehmann–Scheffé theorem, since it is based on a minimal sufficient and complete statistic (i.e.: x). It is also consistent both in probability and in MSE.

当n已知时，参数p可以用成功的比例来估计。 [math]\displaystyle{ \widehat{p} = \frac{x}{n}. }[/math] 这个估计是用最大似然估计法和矩量法来计算的。这个估计是无偏估计，并与最小方差一致，用Lehmann-Scheffé定理证明，因为它是基于最小充分性和完全性统计（即：x）。它在概率和MSE方面也是一致。

 \tilde{p} \pm z \sqrt{ \frac{ \tilde{p} ( 1 - \tilde{p} )}{ n + z^2 } } .

1-tilde { p })}{ n + z ^ 2}.

A closed form Bayes estimator for p also exists when using the Beta distribution as a conjugate prior distribution. When using a general [math]\displaystyle{ \operatorname{Beta}(\alpha, \beta) }[/math] as a prior, the posterior mean estimator is: [math]\displaystyle{ \widehat{p_b} = \frac{x+\alpha}{n+\alpha+\beta} }[/math]. The Bayes estimator is asymptotically efficient and as the sample size approaches infinity (n → ∞), it approaches the MLE solution. The Bayes estimator is biased (how much depends on the priors), admissible and consistent in probability.

当使用Beta分布作为共轭时，p的闭合形式贝叶斯估计也存在。先验分布。当使用一般的[math]\displaystyle{ \lt operatorname{Beta}(\alpha，\beta) }[/math]作为先验时，后验均值估计是。[math]\displaystyle{ \widehat{p_b} = \frac{x+\alpha}{n+\alpha+\beta} }[/math]。Bayes估计是asymptotically efficient，当样本量接近无穷大(n → ∞)时，它接近MLE解。贝叶斯估计是偏倚。(多少取决于前值)，可接受性和一致性的概率。

Here the estimate of p is modified to

这里 p 的估计被修改为

For the special case of using the standard uniform distribution as a non-informative prior ([math]\displaystyle{ \operatorname{Beta}(\alpha=1, \beta=1) = U(0,1) }[/math]), the posterior mean estimator becomes [math]\displaystyle{ \widehat{p_b} = \frac{x+1}{n+2} }[/math] (a posterior mode should just lead to the standard estimator). This method is called the rule of succession, which was introduced in the 18th century by Pierre-Simon Laplace.

对于使用标准均匀分布作为非信息先验的特殊情况（[math]\displaystyle{ operatorname{Beta}(alpha=1, β=1)=U(0, 1) }[/math])，后均值估计变成[math]\displaystyle{ \widehat{p_b}=\frac{x+1}{n+2} }[/math](一个后模应该只是导致标准估计)。这种方法被称为继承规则，由Pierre-Simon Laplace在18世纪引入。

 \tilde{p}= \frac{ n_1 + \frac{1}{2} z^2}{ n + z^2 } 

1 + frac {1}{2} z2}{ n + z2}

When estimating p with very rare events and a small n (e.g.: if x=0), then using the standard estimator leads to [math]\displaystyle{ \widehat{p} = 0, }[/math] which sometimes is unrealistic and undesirable. In such cases there are various alternative estimators. One way is to use the Bayes estimator, leading to: [math]\displaystyle{ \widehat{p_b} = \frac{1}{n+2} }[/math]). Another method is to use the upper bound of the confidence interval obtained using the rule of three: [math]\displaystyle{ \widehat{p_{\text{rule of 3}}} = \frac{3}{n} }[/math])

当估计p时，如果事件非常罕见，而且n很小（例如：如果x=0），那么使用标准估计器会导致[math]\displaystyle{ \widehat{p} = 0, }[/math]，这有时是不现实的，也是不可取的。在这种情况下，有各种不同的估计方法。

Confidence intervals

置信区间

Main article: Binomial proportion confidence interval

\sin^2 \left(\arcsin \left(\sqrt{\widehat{p\,}}\right) \pm \frac{z}{2\sqrt{n}} \right).

Sin ^ 2 left (arcsin left (sqrt { widehat { p，} right) pm frac { z }{2 sqrt { n } right).

Even for quite large values of n, the actual distribution of the mean is significantly nonnormal. Because of this problem several methods to estimate confidence intervals have been proposed.

即使对于相当大的n值，平均数的实际分布也是显著非正态的，由于这个问题，人们提出了几种估计置信区间的方法。

In the equations for confidence intervals below, the variables have the following meaning:

在下面的置信区间公式中，变量具有以下含义

• n₁ is the number of successes out of n, the total number of trials

• n₁是n中的成功次数，即试验的总次数。

• [math]\displaystyle{ \widehat{p\,} = \frac{n_1}{n} }[/math] is the proportion of successes

• [math]\displaystyle{ \lt math\gt widehat{p,} = \frac{n_1}{n} }[/math] 是成功的比例。

The notation in the formula below differs from the previous formulas in two respects:

下列公式中的符号在两个方面不同于以前的公式:

• [math]\displaystyle{ z }[/math] is the [math]\displaystyle{ 1 - \tfrac{1}{2}\alpha }[/math] quantile of a standard normal distribution (i.e., probit) corresponding to the target error rate [math]\displaystyle{ \alpha }[/math]. For example, for a 95% confidence level the error [math]\displaystyle{ \alpha }[/math] = 0.05, so [math]\displaystyle{ 1 - \tfrac{1}{2}\alpha }[/math] = 0.975 and [math]\displaystyle{ z }[/math] = 1.96.

Wald method

Wald法

[math]\displaystyle{ \widehat{p\,} \pm z \sqrt{ \frac{ \widehat{p\,} ( 1 -\widehat{p\,} )}{ n } } . }[/math]

[math]\displaystyle{ \frac{

我不知道



    \widehat{p\,} + \frac{z^2}{2n} + z

2n } + z

: A [[continuity correction]] of 0.5/''n'' may be added.{{clarify|date=July 2012}}

    \sqrt{

2.1.1.2.2.2.2.2.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3



        \frac{\widehat{p\,}(1 - \widehat{p\,})}{n} +

1-widehat { p，})}{ n } + 

==== Agresti–Coull method ====

        \frac{z^2}{4 n^2}

4 n ^ 2}

\lt ref name=Agresti1988\gt {{Citation |last1=Agresti |first1=Alan |last2=Coull |first2=Brent A. |date=May 1998 |title=Approximate is better than 'exact' for interval estimation of binomial proportions |url = http://www.stat.ufl.edu/~aa/articles/agresti_coull_1998.pdf |journal=The American Statistician |volume=52 |issue=2 |pages=119–126 |accessdate=2015-01-05 |doi=10.2307/2685469 |jstor=2685469 }}\lt /ref\gt 

    }

    }



}{

}{

:: \lt math\gt  \tilde{p} \pm z \sqrt{ \frac{ \tilde{p} ( 1 - \tilde{p} )}{ n + z^2 } } . }[/math]

   1 + \frac{z^2}{n}

1 + frac { z ^ 2}{ n }

}</math>

{/math >

Here the estimate of p is modified to

[math]\displaystyle{ \tilde{p}= \frac{ n_1 + \frac{1}{2} z^2}{ n + z^2 } }[/math]

The exact (Clopper–Pearson) method is the most conservative.

确切的(克洛佩尔-皮尔森)方法是最保守的。

Arcsine method

弧线法

Let X ~ B(n,p1) and Y ~ B(m,p2) be independent. Let T = (X/n)/(Y/m).

设 x ~ b (n，p1)和 y ~ b (m，p2)是独立的。设 t = (X/n)/(Y/m)。

Then log(T) is approximately normally distributed with mean log(p1/p2) and variance ((1/p1) − 1)/n + ((1/p2) − 1)/m.

然后log(t)近似呈正态分布，其中平均log(p1/p2)和方差((1/p1)-1)/n + ((1/p2)-1)/m。

[math]\displaystyle{ \sin^2 \left(\arcsin \left(\sqrt{\widehat{p\,}}\right) \pm \frac{z}{2\sqrt{n}} \right). }[/math]

Wilson (score) method

威尔逊法

If X ~ B(n, p) and Y | X ~ B(X, q) (the conditional distribution of Y, given X), then Y is a simple binomial random variable with distribution Y ~ B(n, pq).

如果 x ~ b (n，p)和 y | x ~ b (x，q)(给定 x 的条件分布) ，则 y 是具有分布 y ~ b (n，pq)的简单二项式随机变量。

Main article: Binomial proportion confidence interval § Wilson score interval

For example, imagine throwing n balls to a basket UX and taking the balls that hit and throwing them to another basket UY. If p is the probability to hit UX then X ~ B(n, p) is the number of balls that hit UX. If q is the probability to hit UY then the number of balls that hit UY is Y ~ B(X, q) and therefore Y ~ B(n, pq).

例如，想象一下把 n 个球扔到一个篮子UX里，然后把击中的球扔到另一个篮子UY里。如果 p 是命中 UX 的概率，那么 x ~ b (n，p)是命中 UX 的球数。如果 q 是击中 UY 的概率，那么击中 UY1 的球数是 y ~ b (x，q) ，因此 y ~ b (n，pq)。

The notation in the formula below differs from the previous formulas in two respects:

下面的公式中的符号与前面的公式有两个不同之处

• Firstly, z_x has a slightly different interpretation in the formula below: it has its ordinary meaning of 'the xth quantile of the standard normal distribution', rather than being a shorthand for 'the (1 − x)-th quantile'.

首先，z_x在下式中的解释略有不同：它的普通含义是 "标准正态分布的xth分位数"，而不是"(1 - x)th分位数 "的简写。

• Secondly, this formula does not use a plus-minus to define the two bounds. Instead, one may use [math]\displaystyle{ z = z_{\alpha / 2} }[/math] to get the lower bound, or use [math]\displaystyle{ z = z_{1 - \alpha/2} }[/math] to get the upper bound. For example: for a 95% confidence level the error [math]\displaystyle{ \alpha }[/math] = 0.05, so one gets the lower bound by using [math]\displaystyle{ z = z_{\alpha/2} = z_{0.025} = - 1.96 }[/math], and one gets the upper bound by using [math]\displaystyle{ z = z_{1 - \alpha/2} = z_{0.975} = 1.96 }[/math].

其次，这个公式没有使用加减法来定义两个界限。相反，我们可以使用[math]\displaystyle{ z = z_{/alpha / 2} }[/math]得到下限，或者使用[math]\displaystyle{ z = z_{1 - \alpha/2} }[/math]得到上限。例如：对于95%的置信度，误差[math]\displaystyle{ /alpha }[/math] = 0.05，所以用[math]\displaystyle{ z = z_{/alpha/2} = z_{0.025} = - 1.96 }[/math]得到下限，用[math]\displaystyle{ z = z_{1 - \alpha/2} = z_{0.975} = 1.96 }[/math]得到上限。

Since X \sim B(n, p) and Y \sim B(X, q) , by the law of total probability,

由于 x sim b (n，p)和 y sim b (x，q) ，由全概率公式,

[math]\displaystyle{ \begin{align} 1.1.1.2.2.2.2.2.2.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.4.3.3.3.3.3.3.3 :: \lt math\gt \frac{ \Pr[Y = m] &= \sum_{k = m}^{n} \Pr[Y = m \mid X = k] \Pr[X = k] \\[2pt] \Pr[Y = m] &= \sum_{k = m}^{n} \Pr[Y = m \mid X = k] \Pr[X = k] \\[2pt] \widehat{p\,} + \frac{z^2}{2n} + z &= \sum_{k=m}^n \binom{n}{k} \binom{k}{m} p^k q^m (1-p)^{n-k} (1-q)^{k-m} 和 = sum { k = m } n binom { n }{ k }{ m } p ^ k ^ m (1-p) ^ { n-k }(1-q) ^ { k-m } \sqrt{ \end{align} }[/math]

结束{ align } </math >

       \frac{\widehat{p\,}(1 - \widehat{p\,})}{n} +

Since \tbinom{n}{k} \tbinom{k}{m} = \tbinom{n}{m} \tbinom{n-m}{k-m}, the equation above can be expressed as

由于 tbinom { n }{ k } tbinom { k }{ m } = tbinom { n }{ m } tbinom { n-m }{ k-m } ，上述方程可表示为

       \frac{z^2}{4 n^2}

\Pr[Y = m] = \sum_{k=m}^{n} \binom{n}{m} \binom{n-m}{k-m} p^k q^m (1-p)^{n-k} (1-q)^{k-m} 

Pr [ y = m ] = sum _ { k = m } ^ { n } binom { n-m }{ k-m } p ^ k ^ m (1-p) ^ { n-k }(1-q) ^ { k-m }

   }

Factoring p^k = p^m p^{k-m} and pulling all the terms that don't depend on k out of the sum now yields

对 p ^ k = p ^ m p ^ { k-m }进行分解，从总和中取出所有不依赖于 k 的项，现在就得到了结果

}{

[math]\displaystyle{ \begin{align} 1.1.1.2.2.2.2.2.2.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.4.3 1 + \frac{z^2}{n} \Pr[Y = m] &= \binom{n}{m} p^m q^m \left( \sum_{k=m}^n \binom{n-m}{k-m} p^{k-m} (1-p)^{n-k} (1-q)^{k-m} \right) \\[2pt] [ y = m ] & = binom { n }{ m } p ^ m ^ m left (sum { k = m } n binom { n-m }{ k-m } p ^ { k-m }(1-p) ^ { n-k }(1-q) ^ { k-m } right)[2 pt ] } }[/math]

  &= \binom{n}{m} (pq)^m (1-pq)^{n-m}

& = binom { n }{ m }(pq) ^ m (1-pq) ^ { n-m }

\end{align}</math>

结束{ align } </math >

Comparison

and thus Y \sim B(n, pq) as desired.

因此 y sim b (n，pq)为所需值。

The exact (Clopper–Pearson) method is the most conservative.

The Wald method, although commonly recommended in textbooks, is the most biased.模板:Clarify

Wald法虽然是教科书上普遍推荐的方法，但却是最偏颇的方法。

The Bernoulli distribution is a special case of the binomial distribution, where n = 1. Symbolically, X ~ B(1, p) has the same meaning as X ~ Bernoulli(p). Conversely, any binomial distribution, B(n, p), is the distribution of the sum of n Bernoulli trials, Bernoulli(p), each with the same probability p.

伯努利分布是二项分布的一个特例，其中 n = 1。在符号上，x ~ b (1，p)与 x ~ Bernoulli (p)具有相同的意义。反之，任何二项分布 b (n，p)都是 n 个 Bernoulli 试验之和的分布，每个试验的概率 p 相同。

Related distributions

相关分布

Sums of binomials

二项式之和

The binomial distribution is a special case of the Poisson binomial distribution, or general binomial distribution, which is the distribution of a sum of n independent non-identical Bernoulli trials B(pi).

二项分布是泊松二项分布的一个特例，也叫一般二项分布，它是 n 个独立的不同 Bernoulli 试验 b (pi)的和的分布。

If X ~ B(n, p) and Y ~ B(m, p) are independent binomial variables with the same probability p, then X + Y is again a binomial variable; its distribution is Z=X+Y ~ B(n+m, p):

如果X ~ B(n, p)和Y ~ B(m, p)是独立的二项式变量，概率p相同，那么X  + Y又是一个二项式变量，其分布是Z=X+Y ~ B(n+m, p)。

[math]\displaystyle{ \begin{align} \operatorname P(Z=k) &= \sum_{i=0}^k\left[\binom{n}i p^i (1-p)^{n-i}\right]\left[\binom{m}{k-i} p^{k-i} (1-p)^{m-k+i}\right]\\ Binomial [[probability mass function and normal probability density function approximation for n&nbsp;=&nbsp;6 and p&nbsp;=&nbsp;0.5]] 二项式[ n = 6和 p = 0.5的概率质量函数和正态概率密度函数近似] &= \binom{n+m}k p^k (1-p)^{n+m-k} \end{align} }[/math]

If n is large enough, then the skew of the distribution is not too great. In this case a reasonable approximation to B(n, p) is given by the normal distribution

如果 n 足够大，那么分布的偏斜就不会太大。在这种情况下，通过正态分布给出 b (n，p)的合理近似

However, if X and Y do not have the same probability p, then the variance of the sum will be smaller than the variance of a binomial variable distributed as [math]\displaystyle{ B(n+m, \bar{p}).\, }[/math]

但是，如果X和Y的概率p不一样，那么和的方差将是小于二项式变量的方差分布为[math]\displaystyle{ B(n+m, \bar{p}).\, }[/math]。

\mathcal{N}(np,\,np(1-p)),

数学{ n }(np，np (1-p))

Ratio of two binomial distributions

两个二项分布的比值

and this basic approximation can be improved in a simple way by using a suitable continuity correction.

通过适当的连续性修正，可以简单地改进这种基本近似。

The basic approximation generally improves as n increases (at least 20) and is better when p is not near to 0 or 1. Various rules of thumb may be used to decide whether n is large enough, and p is far enough from the extremes of zero or one:

基本近似通常随着 n 的增加而改进(至少20) ，当 p 不接近0或1时更好。经验法则可以用来判断 n 是否足够大，p 是否远离0或1的极值:

This result was first derived by Katz and coauthors in 1978.

这个结果最早是由Katz和合作者在1978年得出的。

Let X ~ B(n,p₁) and Y ~ B(m,p₂) be independent. Let T = (X/n)/(Y/m).

For example, suppose one randomly samples n people out of a large population and ask them whether they agree with a certain statement. The proportion of people who agree will of course depend on the sample. If groups of n people were sampled repeatedly and truly randomly, the proportions would follow an approximate normal distribution with mean equal to the true proportion p of agreement in the population and with standard deviation \sigma = \sqrt{\frac{p(1-p)}{n}}

例如，假设一个人从一个大群体中随机抽取了 n 个人，然后询问他们是否同意某种说法。同意的人的比例当然取决于样本。如果 n 组人群被重复且真正随机地取样，其比例将遵循一个近似正态分布，其平均值等于总体中一致性的真实比例 p，标准差 σ = sqrt { p (1-p)}{ n }

Then log(T) is approximately normally distributed with mean log(p₁/p₂) and variance ((1/p₁) − 1)/n + ((1/p₂) − 1)/m.

则log(T)近似正态分布，均值log(p₁/p₂)，方差((1/p₁) - 1)/n + ((1/p₂) - 1)/m。

Conditional binomials

条件二项式

If X ~ B(n, p) and Y | X ~ B(X, q) (the conditional distribution of Y, given X), then Y is a simple binomial random variable with distribution Y ~ B(n, pq).

如果X ~ B(n, p)和Y | 'X ~ B(X, q)('Y的条件分布，给定&nbsp。 X），则Y是一个简单的二项式随机变量，其分布为Y ~ B(n, pq)。

The binomial distribution converges towards the Poisson distribution as the number of trials goes to infinity while the product np remains fixed or at least p tends to zero. Therefore, the Poisson distribution with parameter λ = np can be used as an approximation to B(n, p) of the binomial distribution if n is sufficiently large and p is sufficiently small. According to two rules of thumb, this approximation is good if n ≥ 20 and p ≤ 0.05, or if n ≥ 100 and np ≤ 10.

当试验数量趋于无穷大，而产品 np 保持不变或者至少 p 趋于零时，二项分布收敛到泊松分佈。因此，参数 λ = np 的泊松分布可以作为二项分布 b (n，p)的近似，如果 n 是足够大，p 足够小的话。根据两个经验法则，如果 n ≥20和 p ≤0.05，或者如果 n ≥100和 np ≤10，这个近似是好的。

For example, imagine throwing n balls to a basket U_X and taking the balls that hit and throwing them to another basket U_Y. If p is the probability to hit U_X then X ~ B(n, p) is the number of balls that hit U_X. If q is the probability to hit U_Y then the number of balls that hit U_Y is Y ~ B(X, q) and therefore Y ~ B(n, pq).

例如，想象将n个球扔到一个篮子里U_X，然后把击中的球扔到另一个篮子里U_Y。如果p是击中U_X的概率，那么X ~ B(n, p)就是击中U_X的球数。如果q是击中U_Y的概率，那么击中U_Y的球数是Y ~ B(X, q)，因此Y ~ B(n, pq)。

Concerning the accuracy of Poisson approximation, see Novak, ch. 4, and references therein.

关于泊松近似的准确性，参见 Novak，ch。4，及其中的参考资料。

Since [math]\displaystyle{ X \sim B(n, p) }[/math] and [math]\displaystyle{ Y \sim B(X, q) }[/math], by the law of total probability,

[math]\displaystyle{ \begin{align} \Pr[Y = m] &= \sum_{k = m}^{n} \Pr[Y = m \mid X = k] \Pr[X = k] \\[2pt] P(p;\alpha,\beta) = \frac{p^{\alpha-1}(1-p)^{\beta-1}}{\mathrm{B}(\alpha,\beta)}. P (p; alpha，beta) = frac { p ^ { alpha-1}(1-p) ^ { beta-1}{ mathrm { b }(alpha，beta)}}. &= \sum_{k=m}^n \binom{n}{k} \binom{k}{m} p^k q^m (1-p)^{n-k} (1-q)^{k-m} Given a uniform prior, the posterior distribution for the probability of success given independent events with observed successes is a beta distribution. 给定一个一致性先验，给定观察到成功结果的独立事件成功概率的后验分布是一个 beta分布。 \end{align} }[/math]

Since [math]\displaystyle{ \tbinom{n}{k} \tbinom{k}{m} = \tbinom{n}{m} \tbinom{n-m}{k-m}, }[/math] the equation above can be expressed as

由于[math]\displaystyle{ /tbinom{n}{k} \tbinom{k}{m} = \tbinom{n}{m} \tbinom{n-m}{k-m}, }[/math]上式可表示为

[math]\displaystyle{ \Pr[Y = m] = \sum_{k=m}^{n} \binom{n}{m} \binom{n-m}{k-m} p^k q^m (1-p)^{n-k} (1-q)^{k-m} }[/math]

Factoring [math]\displaystyle{ p^k = p^m p^{k-m} }[/math] and pulling all the terms that don't depend on [math]\displaystyle{ k }[/math] out of the sum now yields

将 [math]\displaystyle{ p^k = p^m p^{k-m} }[/math] 进行分解，并将所有不依赖于 [math]\displaystyle{ k }[/math] 的项从总和中抽出，即可得到

Methods for random number generation where the marginal distribution is a binomial distribution are well-established.

边缘分布是二项分布的随机数产生方法已经很完善了。

[math]\displaystyle{ \begin{align} \Pr[Y = m] &= \binom{n}{m} p^m q^m \left( \sum_{k=m}^n \binom{n-m}{k-m} p^{k-m} (1-p)^{n-k} (1-q)^{k-m} \right) \\[2pt] One way to generate random samples from a binomial distribution is to use an inversion algorithm. To do so, one must calculate the probability that for all values from through . (These probabilities should sum to a value close to one, in order to encompass the entire sample space.) Then by using a pseudorandom number generator to generate samples uniformly between 0 and 1, one can transform the calculated samples into discrete numbers by using the probabilities calculated in the first step. 一种从二项分布中产生随机样本的方法是使用'''\lt font color="#ff8000"\gt 反演算法\lt /font\gt '''。要做到这一点，我们必须计算从到的所有值的概率。(为了包含整个样本空间，这些概率之和应该接近于一。)然后，通过使用伪随机数生成器来生成数值为0或1的样本，人们可以使用在第一步计算出的概率将计算出的样本转换成离散数。 &= \binom{n}{m} (pq)^m \left( \sum_{k=m}^n \binom{n-m}{k-m} \left(p(1-q)\right)^{k-m} (1-p)^{n-k} \right) \end{align} }[/math]

After substituting [math]\displaystyle{ i = k - m }[/math] in the expression above, we get

将 [math]\displaystyle{ i = k - m }[/math] 代入上述表达式后，我们得到了

[math]\displaystyle{ \Pr[Y = m] = \binom{n}{m} (pq)^m \left( \sum_{i=0}^{n-m} \binom{n-m}{i} (p - pq)^i (1-p)^{n-m - i} \right) }[/math]

This distribution was derived by Jacob Bernoulli. He considered the case where p = r/(r + s) where p is the probability of success and r and s are positive integers. Blaise Pascal had earlier considered the case where p = 1/2.

这个分布是由雅各布伯努利推导出来的。他考虑了 p = r/(r + s)的情形，其中 p 是成功的概率，r 和 s 是正整数。早些时候，布莱斯 · 帕斯卡考虑过 p = 1/2的情况。

Notice that the sum (in the parentheses) above equals [math]\displaystyle{ (p - pq + 1 - p)^{n-m} }[/math] by the binomial theorem. Substituting this in finally yields

请注意，上述的和（括号内）等于[math]\displaystyle{ (p - pq + 1 - p)^{n-m}。 }[/math]由二项式定理得出。将此代入最终得到

[math]\displaystyle{ \begin{align} \Pr[Y=m] &= \binom{n}{m} (pq)^m (p - pq + 1 - p)^{n-m}\\[4pt] &= \binom{n}{m} (pq)^m (1-pq)^{n-m} \end{align} }[/math]

and thus [math]\displaystyle{ Y \sim B(n, pq) }[/math] as desired.

Bernoulli distribution

伯努利分布

The Bernoulli distribution is a special case of the binomial distribution, where n = 1. Symbolically, X ~ B(1, p) has the same meaning as X ~ Bernoulli(p). Conversely, any binomial distribution, B(n, p), is the distribution of the sum of n Bernoulli trials, Bernoulli(p), each with the same probability p.

伯努利分布是二项分布的特例，其中n = 1.从符号上看，X ~ B(1, p)与X ~ 伯努利(p)具有相同的意义。相反，任何二项分布，B(n, p)是n伯努利试验，伯努利(p)之和的分布，每个概率p相同。

Poisson binomial distribution

泊松二项分布

The binomial distribution is a special case of the Poisson binomial distribution, or general binomial distribution, which is the distribution of a sum of n independent non-identical Bernoulli trials B(p_i).

Category:Discrete distributions

类别: 离散分布

Normal approximation

正态逼近

Category:Factorial and binomial topics

类别: 阶乘和二项式主题

Category:Conjugate prior distributions

类别: 共轭先验分布

文件:Binomial Distribution.svg

Binomial probability mass function and normal probability density function approximation for n = 6 and p = 0.5

Category:Exponential family distributions

类别: 指数族分布

This page was moved from wikipedia:en:Binomial distribution. Its edit history can be viewed at 二项分布/edithistory