Probability Distributions

A probability distribution is a complete model for how probability is assigned to a random variable's possible values. PMFs, densities, CDFs, quantiles, transformations, and distribution families are different views of that model, not interchangeable curve-fitting vocabulary.

A probability distribution is not merely a named curve. It is the rule that assigns probability to every event expressible in terms of a random variable. The curve or table is one representation; the underlying object answers questions such as “what is the probability of a value in this interval?”, “which threshold is exceeded 1% of the time?”, and “how does a transformation change uncertainty?”

A useful model begins with the mechanism that produces outcomes. Counts, waiting times, bounded proportions, measurement noise, and maxima arise from different mechanisms and generally need different distributions.

Random variable, outcome, and observation #

A sample space Ω\Omega contains possible elementary outcomes. A random variable is a function

X:Ω→R.X:\Omega\to\mathbb R.

It maps an outcome to a number. Before observation, XX denotes an uncertain quantity governed by a distribution; after one trial, xx denotes one realized value. A dataset x1,…,xnx_1,\ldots,x_n is not the distribution itself—it is finite evidence about a process that may or may not be stable enough to model with one distribution.

The CDF is the universal representation #

The cumulative distribution function (CDF) of any real-valued random variable is

FX(x)=P(X≤x).F_X(x)=P(X\le x).

Every CDF is nondecreasing, right-continuous, and satisfies

lim⁡x→−∞FX(x)=0,lim⁡x→+∞FX(x)=1.\lim_{x\to-\infty}F_X(x)=0, \qquad \lim_{x\to+\infty}F_X(x)=1.

Interval probabilities follow from its jumps and differences. In particular,

P(a<X≤b)=FX(b)−FX(a).P(a<X\le b)=F_X(b)-F_X(a).

The CDF works for discrete, continuous, and mixed distributions. A probability mass function or density may not exist in the simple form a beginner expects, but the CDF always does.

The generalized quantile function is

Q(p)=inf⁡{x:FX(x)≥p},0<p<1.Q(p)=\inf\{x:F_X(x)\ge p\},\qquad 0<p<1.

This definition handles jumps. It also explains simulation by inverse transform: if UU is uniform on (0,1)(0,1), then Q(U)Q(U) has CDF FF under the usual generalized-inverse construction.

PMF and PDF mean different things #

For a discrete random variable, the probability mass function (PMF) is

pX(x)=P(X=x),pX(x)≥0,∑xpX(x)=1.p_X(x)=P(X=x),\qquad p_X(x)\ge0,\qquad \sum_xp_X(x)=1.

For a continuous random variable with density fXf_X,

P(a≤X≤b)=∫abfX(x) dx,fX(x)≥0,∫−∞∞fX(x) dx=1.P(a\le X\le b)=\int_a^b f_X(x)\,dx, \qquad f_X(x)\ge0, \qquad \int_{-\infty}^{\infty}f_X(x)\,dx=1.

A density is probability per unit of xx, not probability at xx. Therefore P(X=x)=0P(X=x)=0 for a continuous variable even where fX(x)f_X(x) is large, and a density may exceed 1 when concentrated over a narrow interval. Units expose the distinction: if XX is measured in seconds, fXf_X has units 1/second1/\text{second} while FXF_X and probabilities are dimensionless.

Object Discrete Continuous
point value P(X=x)=pX(x)P(X=x)=p_X(x) P(X=x)=0P(X=x)=0
interval probability sum masses integrate density
CDF cumulative sum cumulative integral
normalization ∑pX(x)=1\sum p_X(x)=1 ∫fX(x)dx=1\int f_X(x)dx=1

Distribution families encode mechanisms #

Named families are reusable model shapes with parameters. The parameterization must be stated: libraries disagree about whether a gamma or exponential parameter is a rate or a scale, and whether a normal distribution's second argument is a variance or standard deviation.

Family Support Mechanism it can represent Parameters and key assumption
Bernoulli {0,1}\{0,1\} one binary trial success probability pp
Binomial 0,…,n0,\ldots,n successes in nn trials fixed nn, common pp, independent trials
Poisson 0,1,…0,1,\ldots event count in an exposure constant mean rate and independent increments in the ideal process
Geometric positive or nonnegative integers trials or failures until first success independent Bernoulli trials with fixed pp
Uniform bounded interval equal density over a declared range hard lower and upper bounds
Exponential x≥0x\ge0 waiting time in a Poisson process constant hazard; memorylessness
Normal all real numbers additive aggregate fluctuation location μ\mu, scale σ>0\sigma>0; unbounded symmetric tails
Lognormal x>0x>0 multiplicative positive variation log⁡X\log X is normal
Gamma x>0x>0 sums of positive waiting-time components shape and rate/scale convention required
Beta 0<x<10<x<1 flexible bounded proportions two positive shape parameters

These are candidate mechanisms, not labels assigned by histogram resemblance. Real counts often show overdispersion relative to Poisson; waiting times often have nonconstant hazard; positive measurements may have truncation or censoring; mixtures can look heavy-tailed or multimodal even when each component is simple.

Worked example: count versus waiting time #

Suppose arrivals follow an ideal Poisson process at rate λ=3\lambda=3 per hour. The count N(t)N(t) in tt hours is Poisson:

P(N(t)=k)=e−λt(λt)kk!.P(N(t)=k)=e^{-\lambda t}\frac{(\lambda t)^k}{k!}.

For a 30-minute interval, λt=1.5\lambda t=1.5, so

P(N(0.5)=0)=e−1.5≈0.223.P(N(0.5)=0)=e^{-1.5}\approx0.223.

The waiting time TT to the next arrival is exponential with survival function

P(T>t)=e−λt.P(T>t)=e^{-\lambda t}.

Thus P(T>0.5)=e−1.5P(T>0.5)=e^{-1.5} is the same event expressed in two views: no arrival in the next half hour. The Poisson distribution models a count; the exponential distribution models a waiting time. Sharing a parameter does not make them interchangeable.

Transformations move probability, not just axes #

If Y=g(X)Y=g(X) and gg is differentiable and one-to-one, densities transform by

fY(y)=fX(g−1(y))∣ddyg−1(y)∣.f_Y(y)=f_X\bigl(g^{-1}(y)\bigr) \left|\frac{d}{dy}g^{-1}(y)\right|.

The Jacobian factor is necessary because density is mass per unit length. Stretching the axis spreads the same probability over more yy-space; compressing it concentrates the density.

For Y=aX+bY=aX+b with a≠0a\ne0,

fY(y)=1∣a∣fX(y−ba).f_Y(y)=\frac1{|a|}f_X\left(\frac{y-b}{a}\right).

For a non-monotone transformation, all inverse branches contributing to yy must be summed. Blindly substituting variables without the Jacobian loses normalization.

Joint, marginal, and conditional distributions #

A joint distribution describes several random variables together. Marginalization removes variables by summing or integrating:

fX(x)=∫fX,Y(x,y) dy.f_X(x)=\int f_{X,Y}(x,y)\,dy.

Independence is the factorization

fX,Y(x,y)=fX(x)fY(y)f_{X,Y}(x,y)=f_X(x)f_Y(y)

in density form, with analogous event or PMF statements. Zero correlation is weaker and does not generally imply independence. Conditioning changes the distribution after learning an event or variable value; Bayes' rule governs that update.

Fit is not validity #

Parameters may be known by design, estimated from data, or assigned from prior knowledge. Those are different epistemic situations. A fitted normal curve does not prove observations are independent, identically distributed, uncensored, or generated by one stable population.

A defensible distribution model needs checks at several layers:

  1. Support: can the model generate impossible negative or out-of-range values?
  2. Mechanism: do independence, stationarity, rate, or hazard assumptions match the process?
  3. Shape: do empirical CDFs, quantiles, and tail plots agree where decisions are sensitive?
  4. Dependence: are observations serially, spatially, or hierarchically related?
  5. Selection: were values censored, truncated, rounded, or sampled conditionally?
  6. Use: is the model adequate for the probability, quantile, test, or simulation being computed?

NIST's statistical handbook makes the operational point explicit: a distribution need not be the best-fitting imaginable family, but assumptions must be adequate for the interval, test, or simulation that consumes it. Tail adequacy matters far more for a 99.9th-percentile alarm threshold than for estimating a central median.

The right question is not “which named curve looks familiar?” It is “which probability model preserves the mechanism and the decision-relevant uncertainty, and what evidence would falsify it?”

Binary outcomes and the 65% example #

A YES/NO event with P(YES)=qP(YES)=q follows a Bernoulli distribution:

P(Y=y)=qy(1−q)1−y,y∈{0,1}.P(Y=y)=q^y(1-q)^{1-y},\qquad y\in\{0,1\}.

For q=0.65q=0.65, the distribution assigns mass 0.65 to 1 and 0.35 to 0. It does not assign the realized profit distribution until a purchase price is supplied. At price pp, subtracting pp moves the two outcomes to 1−p1-p and −p-p.

Application to no-hedge #

Each unhedged contract has a binary settlement distribution, but a portfolio is not automatically binomial. Common references and shared resolution events create dependence, so the portfolio loss distribution must preserve those clusters.

Self-check: is a density value of 1.4 an impossible probability?

No. A continuous density is probability per unit and can exceed 1; only integrated probability must lie between 0 and 1.

Sources

  1. docsNIST/SEMATECH e-Handbook of Statistical Methods
  2. docsNIST/SEMATECH e-Handbook — Probability Distributions
  3. docsNIST/SEMATECH e-Handbook — What Is a Probability Distribution?

Searches titles, aliases, headings, summaries, and full text.↑↓ move ↵ open esc close