Probabilistic relation between In-Degree and PageRank

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

1 Citation (Scopus)
1 Downloads (Pure)

Abstract

This paper presents a novel stochastic model that explains the relation between power laws of In-Degree and PageRank. PageRank is a popularity measure designed by Google to rank Web pages. We model the relation between PageRank and In-Degree through a stochastic equation, which is inspired by the original definition of PageRank. Using the theory of regular variation and Tauberian theorems, we prove that the tail distributions of PageRank and In-Degree differ only by a multiplicative constant, for which we derive a closed-form expression. Our analytical results are in good agreement with Web data.
Original languageEnglish
Title of host publicationAlgorithms and Models for the Web-Graph
Subtitle of host publicationFourth International Workshop, WAW 2006, Banff, Canada, November 30 - December 1, 2006. Revised Papers
EditorsWilliam Aiello, Andrei Broder, Jeannette Janssen, Evangelos Milios
Place of PublicationBerlin, Heidelberg
PublisherSpringer
Pages72-83
Number of pages12
ISBN (Electronic)978-3-540-78808-9
ISBN (Print)978-3-540-78807-2
DOIs
Publication statusPublished - 2008
Event4th International Workshop on Algorithms and Models for the Web-Graph, WAW 2006 - Banff, Canada
Duration: 30 Nov 20061 Dec 2006
Conference number: 4

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume4936
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Workshop

Workshop4th International Workshop on Algorithms and Models for the Web-Graph, WAW 2006
Abbreviated titleWAW
CountryCanada
CityBanff
Period30/11/061/12/06

Keywords

  • EWI-14589
  • METIS-254986
  • IR-62603

Fingerprint Dive into the research topics of 'Probabilistic relation between In-Degree and PageRank'. Together they form a unique fingerprint.

Cite this