Page Rank Explained: PR(A) = (1-d) + d (PR(T1)/C(T1) + … + PR(Tn)/C(Tn))

The original PageRank algorithm was described by Lawrence Page and Sergey Brin in several publications. I really enjoyed the series, start at the introduction and read them all if you have the time.

“Contrary to the concept of link popularity, PageRank is not simply based upon the total number of inbound links. The basic approach of PageRank is that a document is in fact considered the more important the more other documents link to it, but those inbound links do not count equally. First of all, a document ranks high in terms of PageRank, if other high ranking documents link to it.

So, within the PageRank concept, the rank of a document is given by the rank of those documents which link to it. Their rank again is given by the rank of documents which link to them. Hence, the PageRank of a document is always determined recursively by the PageRank of other documents. Since – even if marginal and via many links – the rank of any document influences the rank of any other, PageRank is, in the end, based on the linking structure of the whole web. Although this approach seems to be very broad and complex, Page and Brin were able to put it into practice by a relatively trivial algorithm.”

Very good in depth explanation in the article, and simple to follow…kudos

read more | digg story

Leave a Comment

You must be logged in to post a comment.

  • Tags

    adsense advertisement AdWords affiliate programs answers archives article Ask black hat blogging blogs bookmarking Google google adwords googlebot google pr google search information jeremy live MSN optimization overture pagerank page rank pay per click penalty php PPC problems promotion quality content questions ranking rankings search engine optimization sem SEO seo techniques SEO Tips seo tool seo tools trends Yahoo! yahoo search marketing