PageRank in undirected random graphs

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 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.
Liste complète des métadonnées

https://hal.inria.fr/hal-01227383
Contributeur : Arun Kadavankandy <>
Soumis le : vendredi 25 novembre 2016 - 16:45:21
Dernière modification le : lundi 30 avril 2018 - 14:30:10

Fichiers

RR-8983v2.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Konstantin Avrachenkov, Arun Kadavankandy, Liudmila Ostroumova, Andrei Raigorodskii. PageRank in undirected random graphs. [Research Report] RR-8983, Inria Sophia Antipolis. 2015, pp.26. 〈hal-01227383v2〉

Partager

Métriques

Consultations de la notice

237

Téléchargements de fichiers

311