Skip to content
  • Overview
  • Curriculum
    • FLUMental maths and numerical fluency
    • COMBCounting and combinatorics
    • PROBProbability
      • 1Conditioning and Bayes

        • Conditional probability and Bayes
      • 2Distributions

        • The distributions you have to know cold
      • 3Expectation, variance and the big tricks

        • Linearity of expectation
        • Conditioning: the tower property
        • Recursive expected value and the re-roll family
      • 4Random walks and Markov chains

        • Random walks and gambler’s ruin
        • Markov chains: states, transitions and hitting times
      • 5Order statistics and extremes

        • Order statistics: maxima, minima and the gaps between
      • 6Simulation and Monte Carlo

        • Simulation: making randomness you want out of randomness you have
    • GAMEGames, decision theory and puzzles
    • MMMarket making
    • MKTMarkets and products

Practise

  • Question bank
  • Mental arithmetic
  • Market simulator
  • Arbitrage trees
  • Horse racing
  • Bid book
  • Screening tests
  • Mock papers

Reference

  • Formula reference
  • Search

Your record

  • Review queue
  • Progress
  • Leaderboard
  • Profile
  • Invite friends
AccountSend feedback
  1. Curriculum
  2. /Trading and market making
  3. /Probability
  4. /Distributions

The distributions you have to know cold

PROB · Chapter 2·13 min read·Asked at Jane Street, Optiver, Citadel, Two Sigma

After this lesson you should be able to

  • Recall the mean and variance of the standard distributions without deriving them.
  • Recognise which distribution a worded problem is describing.
  • Use memorylessness and the normal tail figures under time pressure.

A small table, known cold, converts a large share of interview probability questions into arithmetic. The skill being tested is recognition — seeing that "how many trials until the first success" is geometric — far more often than derivation.

DistributionDescribesMeanVariance
Bernoulli(p)(p)(p)One trial, success or notpppp(1−p)p(1-p)p(1−p)
Binomial(n,p)(n,p)(n,p)Successes in nnn independent trialsnpnpnpnp(1−p)np(1-p)np(1−p)
Geometric(p)(p)(p)Trials until the first success1/p1/p1/p(1−p)/p2(1-p)/p^2(1−p)/p2
Negative binomial(r,p)(r,p)(r,p)Trials until the rrr-th successr/pr/pr/pr(1−p)/p2r(1-p)/p^2r(1−p)/p2
Poisson(λ)(\lambda)(λ)Count of rare events in a fixed windowλ\lambdaλλ\lambdaλ
HypergeometricDraws without replacementnKNn\tfrac{K}{N}nNK​Below binomial
Uniform on 1..n1..n1..nA fair dien+12\tfrac{n+1}{2}2n+1​n2−112\tfrac{n^2-1}{12}12n2−1​
Table 2.1 · Discrete. The Poisson having mean equal to variance is worth remembering on its own — it is how you spot count data that is over-dispersed.
DistributionDescribesMeanVariance
Uniform(a,b)(a,b)(a,b)No preference within a rangea+b2\tfrac{a+b}{2}2a+b​(b−a)212\tfrac{(b-a)^2}{12}12(b−a)2​
Exponential(λ)(\lambda)(λ)Waiting time for a memoryless event1/λ1/\lambda1/λ1/λ21/\lambda^21/λ2
Normal(μ,σ2)(\mu,\sigma^2)(μ,σ2)Sums of many small independent effectsμ\muμσ2\sigma^2σ2
LognormalA price after multiplicative returnseμ+σ2/2e^{\mu + \sigma^2/2}eμ+σ2/2—
CauchyA ratio of two normalsUndefinedUndefined
Table 2.2 · Continuous. Cauchy is on the list precisely because it has no mean: it is the standard counterexample when someone assumes an average must exist.

Derivation 2.3

Where the die variance comes from

Worth being able to produce, because it is the one people forget.

  1. E[X]=n+12\mathbb{E}[X] = \frac{n+1}{2}E[X]=2n+1​
  2. E[X2]=1n∑i=1ni2=(n+1)(2n+1)6\mathbb{E}[X^2] = \frac{1}{n}\sum_{i=1}^{n} i^2 = \frac{(n+1)(2n+1)}{6}E[X2]=n1​i=1∑n​i2=6(n+1)(2n+1)​
  3. Var⁡(X)=(n+1)(2n+1)6−(n+12)2\operatorname{Var}(X) = \frac{(n+1)(2n+1)}{6} - \left(\frac{n+1}{2}\right)^2Var(X)=6(n+1)(2n+1)​−(2n+1​)2
Var⁡(X)=n2−112⇒a d6 has 3512≈2.92\operatorname{Var}(X) = \frac{n^2 - 1}{12} \quad\Rightarrow\quad \text{a } d6 \text{ has } \frac{35}{12} \approx 2.92Var(X)=12n2−1​⇒a d6 has 1235​≈2.92

Proposition 2.4

Memorylessness

The geometric and the exponential are the only distributions with the property that having waited does not change how much longer you expect to wait: Pr⁡(X>s+t∣X>s)=Pr⁡(X>t)\Pr(X > s + t \mid X > s) = \Pr(X > t)Pr(X>s+t∣X>s)=Pr(X>t). A question that says "given nothing has happened in the first ten minutes" is usually testing exactly this.

Holds when

  • Geometric is the discrete case, exponential the continuous one.
  • It is why the expected additional wait for a six, given no six yet, is still six rolls.

Equation 2.5

Normal tail figures

And in the other direction, the z-scores for the intervals you are asked to quote:

Pr⁡(∣Z∣<1)≈68%,Pr⁡(∣Z∣<2)≈95%,Pr⁡(∣Z∣<3)≈99.7%\Pr(|Z| < 1) \approx 68\%, \quad \Pr(|Z| < 2) \approx 95\%, \quad \Pr(|Z| < 3) \approx 99.7\%Pr(∣Z∣<1)≈68%,Pr(∣Z∣<2)≈95%,Pr(∣Z∣<3)≈99.7%
z50%=0.67z_{50\%} = 0.67z50%​=0.67
Half the mass lies within two thirds of a deviation.
z90%=1.645z_{90\%} = 1.645z90%​=1.645
The one you need most often for a confidence interval.
z95%=1.96z_{95\%} = 1.96z95%​=1.96
Two deviations, near enough, under time pressure.
z99%=2.58z_{99\%} = 2.58z99%​=2.58
For the rare question that asks for a 99% interval.

The rest of this lesson is in Premium

You have read the opening. 13 more sections follow, including 6 worked examples and 3 quick checks.

Start the free 7-day trialSign in

Nothing is charged for 7 days, and you can cancel before then. Or read Arithmetic that survives a clock in full, free.

← Conditional probability and BayesLinearity of expectation →
On this page
  • Discrete
  • Continuous
  • Where the die variance comes from
  • Memorylessness
  • Normal tail figures

QuantMax · 141 lessons · 1342 questions · c5c0caa

  • Premium
  • Arbitrage trees
  • Horse racing
  • Invite friends
  • Account
  • About QuantMax
  • Terms
  • Privacy

Firm names identify publicly reported question patterns and nothing more. QuantMax is not affiliated with, endorsed by, or recruiting for any firm named in the curriculum. Everything you do in lessons and the question bank is kept to your account.