i=0 scale?
  1. In a network with n documents, we assign all documents the same initial PageRank, 1 / n.
  2. We choose a number of steps, k.
  3. We then perform a sequence of k updates to the PageRank values, using the following rule for each update:
    1. Each document divides its current PageRank equally across its outgoing links and passes these equal shares to the documents it links to.
    2. If a document has no outgoing links, it passes all its current PageRank to itself.
    3. Each document updates its new PageRank to be the sum of the shares it receives.
    4. (Optionally) redistribute some portion (in this case, 80%) of each document's PageRank among all the documents.