the spiked model and the BBP transition
/ BBP = Baik-Ben Arous-Peche, BAH-eek ben-ah-ROO PEH-shay /
The spiked model is the random matrix theory of signal detection, and the BBP transition is its central and beautifully sharp result: a phase transition governing whether a low-dimensional signal buried in high-dimensional noise can be detected at all from the spectrum. This is the rigorous backbone of principal component analysis in high dimensions, and it answers the question every practitioner faces: my data's top eigenvalue sticks out above the noise bulk — is that a real signal direction, or just a lucky fluctuation of pure noise?
The spiked covariance model takes the population covariance to be the identity perturbed by a few large 'spike' directions: Sigma = I + theta v v^* for a unit vector v and a signal strength theta > 0 (a rank-one spike, generalising to a few spikes). You observe n samples and form the sample covariance S = (1/n) X X^*, with aspect ratio y = p/n. The pure-noise part fills the Marchenko-Pastur bulk on [a, b] with b = (1 + sqrt(y))^2. The BBP transition (Baik, Ben Arous, Peche, 2005) states there is a critical signal strength theta_c = sqrt(y). If theta <= sqrt(y) (a subcritical, weak spike) the largest sample eigenvalue gets absorbed into the bulk: it converges to the MP edge b and is statistically indistinguishable from noise — the spike is undetectable from the spectrum. If theta > sqrt(y) (a supercritical, strong spike) the largest sample eigenvalue detaches and pops out above the edge, converging to a deterministic outlier location (1 + theta)(1 + y/theta) > b. Even more strikingly, the corresponding top eigenVECTOR has only partial correlation with the true direction v: the squared overlap |<u_hat, v>|^2 converges to a value strictly less than 1 (it is 1 - (y/theta^2)/(1 + y/theta), which is 0 exactly at threshold and rises toward 1 as theta grows), so even a detected spike gives a biased, attenuated estimate of its own direction.
The BBP transition reorganised high-dimensional statistics. It tells you precisely when PCA works and when it fails, and it explains a phenomenon practitioners had observed empirically — that below a signal-to-noise threshold the top principal component is pure noise, and even above it the estimated direction is systematically rotated away from the truth. It underpins detection thresholds in signal processing, the estimation of the number of factors in finance and genomics, and modern phase-transition results for tensor PCA and community detection in networks. The fluctuation of a detached outlier is Gaussian (not Tracy-Widom — that is the bulk-edge law for the no-spike case). A caveat to hold onto: the threshold theta_c = sqrt(y) and the outlier formula depend on the aspect ratio y = p/n, so 'how strong must a signal be to be seen' is fundamentally a function of how high-dimensional your problem is — more variables per sample raises the detection bar. And below threshold the signal is not gone from the data, only from the spectrum; it may still be recoverable by methods that use more than the leading eigenvalue.
You have p = 200 features and n = 200 samples (y = 1), so the MP noise edge is b = (1 + sqrt(1))^2 = 4. Plant a single rank-one signal of strength theta. If theta = 0.8 < sqrt(1) = 1, the top sample eigenvalue sits at 4, drowned in noise — undetectable. If theta = 3 > 1, it detaches to (1 + 3)(1 + 1/3) = 4 * 4/3 approximately 5.33, visibly above the bulk, and the estimated principal direction has squared overlap with the truth of about 1 - (1/9)/(1 + 1/3) approximately 0.92 — detected, but not perfectly aligned.
Below theta_c = sqrt(y) the spike hides in the bulk; above it the eigenvalue detaches but the eigenvector stays biased.
Below the BBP threshold theta_c = sqrt(y) a spike is invisible in the spectrum; above it the eigenvalue detaches but the estimated eigenvector is only partially aligned with the truth (overlap strictly below 1). PCA is biased near threshold, and detectability scales with the aspect ratio p/n.