Fwd: On the Topeka Pagerank questions..

[Subbarao Kambhampati <rao@asu.edu>]

Some of you were confused as to how Topeka pagerank compares to the traditional one.

 
The important thing to note is that  Topeka Pagerank first separates web pages into smaller partitions based on their
color and then does equal amount of processing on each of them. It is thus a significantly more efficient computation--since for
each partition, we have a much smaller transition matrix M. The convergence is fast, but the final stationary page rank can be significantly different from the traditional one
(in particular, the separate but equal processing can sometimes prevent pages in some partitions from reaching their full importance--as the other partitions effectively act as rank sinks ). 

regards
rao