Authors
Konstantin Avrachenkov, Arun Kadavankandy, Liudmila Ostroumova Prokhorenkova, Andrei Raigorodskii
Publication date
2015
Conference
Algorithms and Models for the Web Graph: 12th International Workshop, WAW 2015, Eindhoven, The Netherlands, December 10-11, 2015, Proceedings 12
Pages
151-163
Publisher
Springer International Publishing
Description
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 represents an 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.
Scholar articles
K Avrachenkov, A Kadavankandy… - Algorithms and Models for the Web Graph: 12th …, 2015