<Dd> M i j = (1 / L (p j), if j links to i 0, otherwise (\ displaystyle (\ mathcal (M)) _ (ij) = (\ begin (cases) 1 / L (p_ (j)), & (\ mbox (if)) j (\ mbox (links to)) i \ \ \ 0, & (\ mbox (otherwise)) \ end (cases))) </Dd> <Dl> <Dd> M: = (K − 1 A) T (\ displaystyle (\ mathcal (M)): = (K ^ (- 1) A) ^ (T)), </Dd> </Dl> <Dd> M: = (K − 1 A) T (\ displaystyle (\ mathcal (M)): = (K ^ (- 1) A) ^ (T)), </Dd> <P> where A (\ displaystyle A) denotes the adjacency matrix of the graph and K (\ displaystyle K) is the diagonal matrix with the outdegrees in the diagonal . </P>

How does the google page rank algorithm work