PageRank in undirected random graphs
Social and Information Networks
2016-11-28 v2 Discrete Mathematics
Probability
Spectral Theory
Physics and Society
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.
Cite
@article{arxiv.1511.04925,
title = {PageRank in undirected random graphs},
author = {Konstantin Avrachenkov and Arun Kadavankandy and Liudmila Ostroumova and Andrei Raigorodskii},
journal= {arXiv preprint arXiv:1511.04925},
year = {2016}
}