(i,j)
is a matrix with elements indicating the number of paths of length k between vertices i and j. The product Bk*x gives the sum of all paths of length k emanating from a given vertice. What we find is that as we consider longer and longer paths (as k becomes large) the normalized vector:
will approach the leading eigenvector of B (which consequently is also the leading eigenvector of A)