Linked from

The 38 pages that link to Binomial distribution, each with the reason it gives.

• Binomial coefficientRelated: Its probability formula weights each success count by the corresponding binomial coefficient.

• Binomial theoremRelated: Its probability formula uses binomial coefficients to count success patterns.

• Independence (probability theory)Related: Its probability formula relies on repeated trials with the same success probability and independence.

• Geometric distributionRelated: It counts successes across a fixed horizon, while the geometric distribution counts trials until the first.

• Pascal's triangleRelated: Its probability weights include a row of the triangle as binomial coefficients.

• Stirling's approximationRelated: Approximating its factorials gives useful estimates for probabilities and tail behavior.

• Beta distributionRelated: Its unknown success probability is commonly assigned a beta prior.

• Chernoff boundRelated: Chernoff bounds give exponentially small estimates for unusually high or low success counts.

• Method of momentsRelated: Its mean directly relates the success probability to the observed sample average.

• Order statisticRelated: Counting observations below a threshold yields binomial probabilities for an order statistic.

• Jacob BernoulliRelated: It models the success counts whose relative frequencies Bernoulli studied.

• Abraham de MoivreRelated: Its probabilities are central to de Moivre’s normal approximation.

• CombinationRelated: Its probability formula counts which trial positions produce the specified number of successes.

• Gambler’s ruinRelated: After a fixed number of bets, wins and losses determine the fortune’s displacement.

• Bernoulli's inequalityRelated: Bounds on powers of 1+x help estimate probabilities built from repeated independent trials.

• Vandermonde's identityRelated: Combining independent binomial counts invokes the coefficient identity behind binomial convolution.

• Pascal's ruleRelated: Its probability formula contains coefficients readily computed by the recurrence.

• Rao–Blackwell theoremRelated: Its sufficient success count can replace individual outcomes when conditioning an estimator.

• Condorcet's jury theoremRelated: It models how many voters choose correctly when each votes independently with equal accuracy.

• Lehmann–Scheffé theoremRelated: The success count is complete and sufficient for the success probability in the fixed-trial model.