Posted by redstarweb in Google
on Jun 16th, 2009 | 0 comments
By Matt Cutts
People think about PageRank in lots of different ways. People have compared PageRank to a “random surfer” model in which PageRank is the probability that a random surfer clicking on links lands on a page. Other people think of the web as an link matrix in which the value at position (i,j) indicates the presence of links from page i to page j. In that case, PageRank corresponds to the principal eigenvector of that normalized link matrix.
Disclaimer: Even when I joined the company in 2000, Google was doing more sophisticated link computation than you would observe from the classic...