2000 character limit reached
PageRank in undirected random graphs (1511.04925v2)
Published 16 Nov 2015 in cs.SI, cs.DM, math.PR, math.SP, and physics.soc-ph
Abstract: PageRank has numerous applications in information retrieval, reputation systems, machine learning, and graph partitioning.In this paper, we study PageRank in undirected random graphs with expansion property. The Chung-Lu random graph representsan example of such graphs. We show that in the limit, as the size of the graph goes to infinity, PageRank can be represented by a mixture of the restart distribution and the vertex degree distribution.