The Covariance That Tells You the Graph
Suppose is a multivariate Gaussian random vector with mean zero and covariance matrix . Let be the precision matrix.
The puzzle: Show that (the entry of is zero) if and only if , i.e., and are conditionally independent given all other variables.
In other words: the zeros of the precision matrix encode the conditional independence graph. Why?
Answer: Precision Matrix and Conditional Independence
Key Idea / Intuition
For a Gaussian, everything is determined by means and covariances — and conditional distributions are still Gaussian. The key insight is that conditioning on other variables corresponds to a partial regression, and the precision matrix entry is (up to scaling) precisely the partial correlation between and after removing the linear influence of all other variables. When this partial correlation is zero, the two variables are conditionally independent — because for Gaussians, zero correlation equals independence.
Formal Proof / Solution
Step 1: Partition and the conditional distribution.
Without loss of generality, consider variables , and . Write the joint density as
We want to check whether .
Step 2: Factor the exponent.
The conditional density of given is proportional to viewed as a function of with fixed. The cross-term between and in the exponent is
All other terms involving or factor into functions of alone or alone (after completing the square in ).
So the conditional density factors as:
Step 3: Conditional independence iff no cross term.
The conditional density of factors into if and only if there is no cross-term in the exponent, i.e.,
When , the joint conditional density factors, so .
Step 4: The precision entry is the partial correlation (up to scaling).
One can make this even more concrete. By the formula for the inverse of a partitioned matrix, the entry of satisfies
which is (up to sign and scaling) the partial correlation . So:
Summary:
This is why the sparsity pattern of is the Gaussian graphical model: an edge is absent between and exactly when , i.e., when and are conditionally independent. Estimating with an penalty (graphical lasso) thus directly recovers the graph structure by driving small entries to zero.
Source: The Elements of Statistical Learning, Hastie, Tibshirani et al., 2nd ed., Chapter 17