This talk will explore a connection between combinatorics and algebraic statistics. In particular, we will look at Gaussian graphical models, whose covariance matrices can be given in terms of certain path families called treks. Inspired by classical results in algebraic combinatorics, we develop a graph-theoretic criterion for determining the rank of a submatrix of the covariance matrix.