the page rank calculation still follow the “BackRub” Algorithm for you? A check of the PR algorithm, with examples from real-world websites.
Many times, we often hear such speculations: page ranking calculations have changed. Disappointingly, this is the voice of those who should know more. Perhaps, when a spam website (competitor) or a “Google bomb” pushes a website to a PR-7 website, the jealous green monster will be better judged. We will continue to break some urban legends.
The homepage must have a higher level of public relations than other websites.
The old page gets the highest PR.
Google considers “on-page” factors or content to judge public relations.
Pages with most external links have the highest PR.
To prove our assertion more rigorously, let us first quickly introduce page ranking calculations.
Page ranking uses the Google page ranking formula to measure the importance of the page:
PR(A) = (1-d) + d (PR(T1)/C(T1) + … + PR(Tn)/C(Tn))
The page rank displayed on the toolbar is actually a zoom number between 0-10. The scale is logarithmic to accommodate different numbers of IBLs, where a linear scale cannot convey the information properly.
Although we don’t know the log factor “lf” that Google uses for page ranking toolbar standardization, we tried this number with some assumptions. We assume that Google is the highest ranked PR10 page. We use the number of links to Google reported by Google itself. On March 29, 2006, it showed that it had 3.75 million links. We further assume that the average page rank of links to the Google homepage is pr1.
Therefore, to obtain the upper bound (“lf”) of the logarithmic factor, we only need to take the appropriate roots. (For example ((link to Google)^(1/(Google PR-Average_Incoming_PR))).
This boils down to (3.75*10^6)^(1/(9)) or lf=5.38. Naturally, as the size of the web increases, or the number of back links that Google exports to outside world increases, “lf “Is likely to increase. Our tool allows you to set a different “lf”.
We use the following formula to scale the number to “RPR” (actual denormalized PR) and get the upper and lower bounds.
((lf)^(n)) =< RPRn <((lf)^(n+1))
As an example when n=5, 4507