The Physics Travel Guide

Statistics

Prerequisites: Calculus.

Why is it interesting?

For many extremely illuminating visualizations, see http://students.brown.edu/seeing-theory/


  • Probability is starting with an animal, and figuring out what footprints it will make
  • Statistics is seeing a footprint, and guessing the animal.

Probability is straightforward: you have the bear. Measure the foot size, the leg length, and you can deduce the footprints. "Oh, Mr. Bubbles weighs 400lbs and has 3-foot legs, and will make tracks like this." More academically: "We have a fair coin. After 10 flips, here are the possible outcomes."

Statistics is harder. We measure the footprints and have to guess what animal it could be. A bear? A human? If we get 6 heads and 4 tails, what're the chances of a fair coin?#

A Brief Introduction to Probability & Statistics by Kalid Azad


Important related concepts:

Intuitive

Every measurement fluctuates. If we count how many particles hit a detector in one minute and repeat the count, we get a slightly different number each time. Probability theory starts from a known random process and predicts how the results will be spread. Statistics goes the other way: it starts from the observed results and asks what we can say about the process that produced them.

Two questions come up again and again. The first is estimation: what is the best guess for a quantity, such as a particle mass, and how uncertain is that guess? Averaging many measurements helps, and the uncertainty of an average shrinks with the square root of the number of measurements. Four times as much data halves the error bar.

The second is testing: is an observed effect real, or could it be a fluctuation? If a plot of collision events shows a small bump, we ask how often the known background alone would produce a bump at least that large. If that happens only very rarely, we take the bump as evidence for something new. In particle physics a discovery is announced only when the background alone would give such an excess with a probability of less than about one in three and a half million, the "five sigma" standard.

There are two schools of interpretation. Frequentists read probabilities as long-run frequencies in repeated experiments. Bayesians read them as degrees of belief that are updated when new data arrive (see Bayesian statistics). For large data sets the two usually lead to similar numbers, but the statements mean different things.

Concrete

Estimating a mean. Suppose we measure a quantity NN times and get x1,…,xNx_1,\ldots,x_N, each drawn independently from a distribution with mean μ\mu and standard deviation σ\sigma. The sample mean and sample variance

xˉ=1N∑i=1Nxi,s2=1N−1∑i=1N(xi−xˉ)2\bar x = \frac{1}{N}\sum_{i=1}^N x_i, \qquad s^2 = \frac{1}{N-1}\sum_{i=1}^N (x_i-\bar x)^2

are unbiased estimators: their expectation values are μ\mu and σ2\sigma^2. The variance of xˉ\bar x is σ2/N\sigma^2/N, so the standard error of the mean is σ/N\sigma/\sqrt N, estimated by s/Ns/\sqrt N. By the central limit theorem xˉ\bar x is approximately Gaussian for large NN, whatever the distribution of the single xix_i.

Likelihood. If the data are described by a probability density p(x∣θ)p(x\mid\theta) depending on parameters θ\theta, the likelihood of independent data is

L(θ)=∏i=1Np(xi∣θ),L(\theta) = \prod_{i=1}^N p(x_i\mid\theta) ,

viewed as a function of θ\theta at fixed data. The maximum likelihood estimator θ^\hat\theta maximises LL, or equivalently minimises −ln⁡L-\ln L. For measurements yiy_i at points xix_i with Gaussian errors σi\sigma_i around a model f(x;θ)f(x;\theta),

−2ln⁡L(θ)=∑i(yi−f(xi;θ))2σi2+const=χ2(θ)+const,-2\ln L(\theta) = \sum_i \frac{\left(y_i - f(x_i;\theta)\right)^2}{\sigma_i^2} + \text{const} = \chi^2(\theta) + \text{const},

so maximum likelihood reduces to the method of least squares. For a single parameter, the interval in which χ2\chi^2 rises by at most 11 above its minimum is an approximate 68%68\% confidence interval. If the model is correct and linear in θ\theta, the minimal χ2\chi^2 follows a χ2\chi^2 distribution with N−kN - k degrees of freedom (kk the number of fitted parameters), whose mean is N−kN-k; a value of χmin⁡2/(N−k)\chi^2_{\min}/(N-k) far above one signals a bad fit or underestimated errors.

Counting experiments. The number nn of events of a rare process in a fixed time follows a Poisson distribution, P(n∣ν)=νne−ν/n!P(n\mid\nu) = \nu^n e^{-\nu}/n!, with mean and variance both equal to ν\nu. This is the origin of the familiar n\sqrt n error on a count.

Significance. To test a background-only hypothesis H0H_0 we choose a test statistic and compute the pp-value: the probability, assuming H0H_0, of a result at least as extreme as the observed one. It is common to quote it as a Gaussian significance ZZ through p=∫Z∞12πe−t2/2dtp = \int_Z^\infty \frac{1}{\sqrt{2\pi}}e^{-t^2/2}dt. The particle physics discovery threshold Z=5Z = 5 corresponds to a one-sided p≈2.9×10−7p\approx 2.9\times10^{-7}. A pp-value is not the probability that H0H_0 is true; that would require a prior and Bayes' theorem.

Recommended Reading:

Abstract

A statistical model is a family {Pθ}θ∈Θ\{P_\theta\}_{\theta\in\Theta} of probability measures on a sample space X\mathcal{X}, with probability itself defined by Kolmogorov's axioms. An estimator is a measurable map θ^:XN→Θ\hat\theta:\mathcal{X}^N\to\Theta, and a confidence set at level 1−α1-\alpha is a data-dependent set C(x)C(x) with Pθ(θ∈C(x))≥1−αP_\theta(\theta\in C(x))\geq 1-\alpha for every θ\theta. The probability statement refers to CC, not to θ\theta.

For a regular one-parameter model with density p(x∣θ)p(x\mid\theta) the Fisher information is

I(θ)=Eθ[(∂∂θln⁡p(x∣θ))2]=− Eθ[∂2∂θ2ln⁡p(x∣θ)].I(\theta) = \mathbb{E}_\theta\left[\left(\frac{\partial}{\partial\theta}\ln p(x\mid\theta)\right)^2\right] = -\,\mathbb{E}_\theta\left[\frac{\partial^2}{\partial\theta^2}\ln p(x\mid\theta)\right].

The Cramér-Rao bound states that any unbiased estimator from NN independent observations satisfies Varθ(θ^)≥1/(NI(θ))\mathrm{Var}_\theta(\hat\theta)\geq 1/(N I(\theta)). Under regularity conditions the maximum likelihood estimator is consistent and asymptotically normal, N(θ^−θ)→N(0,I(θ)−1)\sqrt N(\hat\theta-\theta)\to\mathcal{N}(0, I(\theta)^{-1}), so it attains the bound asymptotically. For several parameters Iab(θ)I_{ab}(\theta) is a matrix, and it defines a Riemannian metric on the parameter manifold Θ\Theta (the Fisher-Rao metric), the starting point of information geometry.

Hypothesis tests are compared by their size (probability α\alpha of rejecting a true H0H_0) and power (probability of rejecting H0H_0 when H1H_1 is true). For two simple hypotheses the Neyman-Pearson lemma states that the test rejecting H0H_0 when p(x∣H1)/p(x∣H0)p(x\mid H_1)/p(x\mid H_0) exceeds a threshold is the most powerful test of its size. For composite hypotheses one uses the profile likelihood ratio

λ(θ0)=sup⁡νL(θ0,ν)sup⁡θ,νL(θ,ν),\lambda(\theta_0) = \frac{\sup_{\nu} L(\theta_0,\nu)}{\sup_{\theta,\nu}L(\theta,\nu)} ,

where ν\nu are nuisance parameters. Wilks' theorem states that, under H0H_0 and regularity conditions, −2ln⁡λ-2\ln\lambda is asymptotically χ2\chi^2 distributed with as many degrees of freedom as the number of parameters fixed by H0H_0. The conditions fail, for example, when θ0\theta_0 lies on the boundary of Θ\Theta (a signal strength restricted to be non-negative, tested at zero), which is a standard situation in searches and changes the asymptotic distribution.

In the Bayesian formulation one specifies a prior π(θ)\pi(\theta) and computes the posterior π(θ∣x)=p(x∣θ)π(θ)/∫p(x∣θ′)π(θ′)dθ′\pi(\theta\mid x) = p(x\mid\theta)\pi(\theta)/\int p(x\mid\theta')\pi(\theta')d\theta'. Model comparison uses the ratio of marginal likelihoods (Bayes factor). For regular models the posterior concentrates around θ^\hat\theta with covariance (NI(θ^))−1(N I(\hat\theta))^{-1} for large NN (Bernstein-von Mises theorem), which is why frequentist and Bayesian intervals often agree numerically for large samples.

Leads to: Bayesian Statistics, Entropy, Expectation Values, Monte-Carlo Simulations, Random Walks, Statistical Distribution Functions.