1. Understanding Google’s PageRank™ Amy Langville, Carl Meyer, Google’s Page Rank and Beyond: The Science of Search Engine Rankings. Princeton University Pres, 2006
11. CMS matrix This can’t go on forever Some values are equivalent (ties). In the interest of speed and efficiency, we need to know if the ranks converge—that is, will we break all ties, or will we keep doing this indefinitely and never have a decisive ranking? To determine this, the formula must be transformed using binary adjacency transformation, and Markov chain theory. 1 2 3 6 4 5
12.
13. Now, you can treat a row as a vector, or set of values P 1 P 2 P 3 P 4 P 5 P 6 P 1 0 ½ ½ 0 0 0 P 2 0 0 0 0 0 0 P 3 1/3 1/3 0 0 1/3 0 P 4 0 0 0 0 ½ ½ P 5 0 0 0 ½ 0 ½ P 6 0 0 0 1 0 0 [ ]
14. This is a sparse matrix. That’s good. P 1 P 2 P 3 P 4 P 5 P 6 P 1 0 ½ ½ 0 0 0 P 2 0 0 0 0 0 0 P 3 1/3 1/3 0 0 1/3 0 P 4 0 0 0 0 ½ ½ P 5 0 0 0 ½ 0 ½ P 6 0 0 0 1 0 0 [ ]