Know more about The PageRank and its Algorithm

The unique PageRank algorithm was described by Lawrence Page and Sergey Brin in numerous publications. It is given by

PR(A) = (1-d) + d (PR(T1)/C(T1) + ... + PR(Tn)/C(Tn))

Where,

* PR(A) is the PageRank of page A

* PR(Ti) is the PageRank of pages Ti which link to page A

* C(Ti) is the how many outbound links on page Ti and

* d is a damping factor which can be set involving 0 and 1.

Therefore, first of all, we see that PageRank does not rank web sites all together, however is determined for each web page individually. Additional, the PageRank of page A is recursively defined by the PageRanks of those web pages which link to page A.

The PageRank of web pages Ti which link to page A does not influence the PageRank of page A consistently. Within the PageRank algorithm, the PageRank of a web page T is for all time weighted by the number of outbound links C(T) on page T. This means that the more outbound links a web page T has, the less will page A gain from a link to it on page T.

The weighted PageRank of web pages Ti is afterward added up. The outcome of this is that an added inbound link for page A will always increase page A's PageRank.

To finish, the sum of the weighted PageRanks of all pages Ti is multiplied with a damping factor d which can be set linking 0 and 1. So, the extend of PageRank benefit for a page by another web page linking to it is reduced.