1. Distribution of PageRank Values
PageRank  is a link-based ranking function with a recursive definition: a page with a high PageRank is cited by many pages with high PageRank. More precisely, let A be the link matrix of a Web graph of n pages, such that iff there is a hyperlink between pages i and j in the Web graph. Let P be the row-normalized version of this matrix, such that . The PageRank vector is defined as the stationary distribution of the matrix .
We calculated the PageRank over a graph with 1 million nodes and 22 million edges; this graph was obtained from a crawl restricted to the .GR domain , and corresponds only to the main strongly connected component of that graph. The reason why we are using only the strongly connected component is that we want to compute the PageRank distribution also for high values of ALPHA, up to 0.99.
In Figure 1 we show the PageRank distribution for varying values of the damping factor, using a complementary cumulative distribution function (1 - C.D.F.) plot. The tail, starting around the top 5%-10% of the nodes, always follows a power-law with the same exponent no matter which damping factor we choose. The distribution for the remaining 90%-95% of the data varies with the damping factor.
We tried fitting a power-law distribution to the distribution of PageRank using the Hill estimator ; in this data set with there seems to be a power-law distribution over the entire range, but in other cases the power-law only fits the tail.
Next we consider a Double Pareto distribution. The Double Pareto distribution looks like a bi-lineal in a log-log plot, and can be seen as similar to a log-normal. If we assume this model, we can fit a power-law separately to the body and the tail of the distribution, as shown in Figure 2. We confirmed that there is a varying slope in the body of the distribution and a fixed slope in the tail. The tail corresponds to highly-ranked pages and begins roughly at the intersection point in Figure 1, which corresponds to PageRank.
The tail of the distribution appears to follow a constant exponent, no matter which damping factor is used, while for most of the pages the distribution depends on the damping factor. For some particular values of the damping factor, both exponents are close to each other and the distribution looks like a power-law over the entire range. The exponent in the tail is about 2.2, which is the same exponent as the power-law for the in-degree in this dataset. This coincidence between the distribution of in-degree and the tail of PageRank was also observed in .
2. A Damping Factor to Get a Single Power-Law
In this section we assume the Double pareto model with
intersection around 1/n and show that this hypothesis
provides a reasonable explanation to the observation of a
power-law distribution for the PageRank in many cases. Observe
first that at every iteration of the computation, every page is
given a baseline probability given by
If for all points greater than a distribution follows a power-law with exponent , its probability density function p(x) and cumulative distribution function F(x) are 
where we have imposed the constraint that this particular distribution has a maximum possible value of 1. Following figure 1, we now compute 1-F(1/n). Straightforward computations show that, if , as is in all cases of practical interest, . The meaning of this result is that, if we assume that a single Pareto distribution approximates the PageRank distribution over the entire range of values, then 1-F(1/n) does not depend on n. If we adopt the hypothesis of the Double Pareto distribution, this is what should happen for the particular value of such that the distributions that approximate the body and the tail have the same exponent.
In our case, if we accept the hypothesis in , that is, the power-law exponent for the distribution of the tail of the PageRank values is the same as for the in-degree of pages (as has been observed experimentally in most Web characterization studies), then in our collection of 1 million nodes with and , the value predicted is and the observed 0.12. In the WebBase collection of 130 million documents  with and the predicted is and the observed is 0.16. The value of 1-F(1/n) in fact, does not seem to depend on n. Finally, also the *.brown.edu example considered in  shows a change of behaviour around 1/n (slightly more than in their case), although they provide the raw histogram and not the cumulative distribution.
Having a single power-law over the entire range could be useful if we want to combine the PageRank values with other scoring functions, as in that case has a uniform distribution.
3. Lognormal plus Baseline Model
Next we consider the power-law distribution as the sum of two
random variables; let X be a random variable distributed
according to a log-normal with parameters and . Let
F(x) be the cumulative density function (CDF) of
X. We now consider
as a random variable which should have a distribution similar to the one of PageRank. The CDF of this distribution is:
For obtaining the and parameters, we fitted this distribution to the distribution of PageRank with using least-squares method. The result is shown in Figure 3. The obtained parameters are , . We have observed that with the same and , our model fits PageRank also for all the other values of ... with an average relative error of less than 1.5% over the entire range of PageRank values.
E. Efthimiadis and C. Castillo.
Charting the Greek Web.
In Proc. of ASIST, Providence, Rhode Island, USA, Nov. 2004.
B. M. Hill.
A simple general approach to inference about the tail of a distribution.
The Annals of Statistics, 3:1163-1174, 1975.
J. Hirai, S. Raghavan, H. Garcia-Molina, and A.
Webbase: a repository of web pages.
Computer Networks (Amsterdam, Netherlands: 1999), 33(1-6):277-293, 2000.
M. E. J. Newman.
Power laws, pareto distributions and zipf's law.
Contemporary Physics, 46:323-351, December 2005.
L. Page, S. Brin, R. Motwani, and T. Winograd.
The PageRank citation ranking: bringing order to the Web.
Technical report, Stanford Digital Library Technologies Project, 1998.
G. Pandurangan, P. Raghavan, and E. Upfal.
Using Pagerank to characterize Web structure.
In Proc. of COCOON, vol. 2387 of Lecture Notes in Computer Science, pages 330-390, Singapore, Aug. 2002.