Linked from

The 15 pages that link to Geometric distribution, each with the reason it gives.

• Binomial distributionCompared with: It counts trials until success rather than successes within a fixed trial count.

• Poisson distributionCompared with: It counts trials until an event rather than events within a fixed interval.

• Probability mass functionBroader topic: Its point probabilities express how long a sequence of failures lasts before success.

• Exponential distributionCompared with: It is the discrete-time counterpart of exponential waiting times and has a discrete memoryless property.

• Bernoulli distributionCompared with: It tracks waiting time across Bernoulli trials rather than one trial’s outcome.

• Geometric progressionRelated: Its probabilities across trial counts are successive powers of the failure probability.

• Bernoulli trialRelated: It uses repeated Bernoulli trials to model waiting until success.

• Coupon collector's problemRelated: Each stage waits for a draw from one of the still-missing types.

• Hypergeometric distributionCompared with: It models waiting time to a success, not the count in a fixed-size sample.

• Negative binomial distributionBroader topic: It is the special case requiring exactly one success.

• St. Petersburg paradoxRelated: It models how many coin tosses occur before the lottery pays.

• Poisson limit theoremCompared with: It models waiting time between successes rather than the binomial count taken to a Poisson limit.

• Discrete uniform distributionCompared with: Its probabilities decrease across possible trial counts instead of remaining equal.

• Law of total expectationRelated: Conditioning on the first trial gives a compact recursive expectation calculation.

• Infinite monkey theoremRelated: For non-overlapping blocks, the waiting time for a target has this distribution.