Counting Walks and Paths of Fixed Length

The number of walks of length $k$ from $i$ to $j$ is the $(i,j)$ entry of $A^k$; length-$2$ paths come from counting neighbor-pairs per vertex.