Random Walks on Directed Networks: the Case of PageRank
摘要
PageRank, the prestige measure for Web pages used by Google, is the stationary probability of a peculiar random walk on directed graphs, which interpolates between a pure random walk and a process where all nodes have the same probability of being visited. We give some exact results on the distribution of PageRank in the cases in which the damping factor q approaches the two limit values 0 and 1. When q -> 0 and for several classes of graphs the distribution is a power law with exponent 2, regardless of the in-degree distribution. When q -> 1 it can always be derived from the in-degree distribution of the underlying graph, if the out-degree is the same for all nodes.
引用
@article{arxiv.physics/0604203,
title = {Random Walks on Directed Networks: the Case of PageRank},
author = {Santo Fortunato and Alessandro Flammini},
journal= {arXiv preprint arXiv:physics/0604203},
year = {2015}
}
备注
15 pages, 10 figures. Minor modifications, references added, final version to appear in the Special Issue "Complex Networks' Structure and Dynamics'' of the International Journal of Bifurcation and Chaos