WebBase: a repository of Web pages
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Using PageRank to Characterize Web Structure
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Temporal Analysis of the Wikigraph
WI '06 Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence
RankMass crawler: a crawler with high personalized pagerank coverage guarantee
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
PageRank and the random surfer model
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Probabilistic Relation between In-Degree and PageRank
Algorithms and Models for the Web-Graph
Determining factors behind the PageRank log-log plot
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
| Hi-index | 0.00 |
We show that the empirical distribution of the PageRank values in a large set of Web pages does not follow a power-law except for some particular choices of the damping factor. We argue that for a graph with an in-degree distribution following a power-law with exponent between 2.1 and 2.2, choosing a damping factor around 0.85 for PageRank yields a power-law distribution of its values. We suggest that power-law distributions of PageRank in Web graphs have been observed because the typical damping factor used in practice is between 0.85 and 0.90.