PageRank and rank-reversal dependence on the damping factor
arXiv:1201.4787 · doi:10.1103/PhysRevE.86.066104
Abstract
PageRank (PR) is an algorithm originally developed by Google to evaluate the importance of web pages. Considering how deeply rooted Google's PR algorithm is to gathering relevant information or to the success of modern businesses, the question of rank-stability and choice of the damping factor (a parameter in the algorithm) is clearly important. We investigate PR as a function of the damping factor d on a network obtained from a domain of the World Wide Web, finding that rank-reversal happens frequently over a broad range of PR (and of d). We use three different correlation measures, Pearson, Spearman, and Kendall, to study rank-reversal as d changes, and show that the correlation of PR vectors drops rapidly as d changes from its frequently cited value, . Rank-reversal is also observed by measuring the Spearman and Kendall rank correlation, which evaluate relative ranks rather than absolute PR. Rank-reversal happens not only in directed networks containing rank-sinks but also in a single strongly connected component, which by definition does not contain any sinks. We relate rank-reversals to rank-pockets and bottlenecks in the directed network structure. For the network studied, the relative rank is more stable by our measures around than at .
arXiv comment14 pages, 9 figures
References in corpus (15)
- The structure and function of complex networks
- Maps of random walks on complex networks reveal community structure
- Prediction and predictability of global epidemics: the role of the airline transportation network
- Voter Model on Heterogeneous Graphs
- Understanding the spreading patterns of mobile phone viruses
- Finding Scientific Gems with Google
- Diffusion of scientific credits and the ranking of scientists
- LinkRank: Finding communities in directed networks
- Who is the best player ever? A complex network analysis of the history of professional tennis
- Fixation and consensus times on a network: a unified approach
- Slave nodes and the controllability of metabolic networks
- Impact of hierarchical modular structure on ranking of individual nodes in directed networks
- Measuring degree-degree association in networks
- Sampling properties of directed networks
- Random Walks on Complex Networks