  We consider two notions describing how one finite graph may be larger than
another. Using them, we prove several theorems for such pairs that compare the
number of spanning trees, the return probabilities of random walks, and the
number of independent sets, among other combinatorial quantities. Our methods
involve inequalities for determinants, for traces of functions of operators,
and for entropy.
