  We give upper and lower bounds on the largest singular value of a matrix
using analogues to walks in graphs. For nonnegative matrices these bounds are
asymptotically tight. In particular, we improve a bound due to I. Schur.
