PageRank in undirected random graphs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

PageRank in undirected random graphs

Résumé

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.
Fichier principal
Vignette du fichier
RR-XX.pdf (880.57 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01227383 , version 1 (16-11-2015)
hal-01227383 , version 2 (25-11-2016)

Identifiants

Citer

Konstantin Avrachenkov, Arun Kadavankandy, Liudmila Ostroumova, Andrei Raigorodskii. PageRank in undirected random graphs. 12th Workshop on Algorithms and Models for the Web Graph (WAW 2015), Nov 2015, Eindhoven, Netherlands. pp.151-163, ⟨10.1007/978-3-319-26784-5_12⟩. ⟨hal-01227383v1⟩
259 Consultations
1479 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More