Hoffman's theorem gives an upper bound on the independence ratio of regular graphs in terms of the minimum eigenvalue of the adjacency matrix. We use invariant Gaussian processes on graphs to get a lower bound in the vertex-transitive case. Joint work with Bálint Virág.