Asymptotic analysis for personalized web search

Yana Volkovich, Nelly Litvak

Research output: Contribution to journalArticleAcademicpeer-review

32 Citations (Scopus)
24 Downloads (Pure)

Abstract

PageRank with personalization is used in Web search as an importance measure for Web documents. The goal of this paper is to characterize the tail behavior of the PageRank distribution in the Web and other complex networks characterized by power laws. To this end, we model the PageRank as a solution of a stochastic equation $R \buildrel\rm D\over= \sum^N_{i=1} A_i R_i + B$, where the $R_i$s are distributed as $R$. This equation is inspired by the original definition of the PageRank. In particular, $N$ models the number of incoming links to a page, and $B$ stays for the user preference. Assuming that $N$ or $B$ are heavy tailed, we employ the theory of regular variation to obtain the asymptotic behavior of $R$ under quite general assumptions on the involved random variables. Our theoretical predictions show good agreement with experimental data.
Original languageEnglish
Pages (from-to)577-604
Number of pages28
JournalAdvances in applied probability
Volume42
Issue number2
DOIs
Publication statusPublished - 2010

Keywords

  • MSC-68P10
  • MSC-90B15
  • MSC-40E05
  • PageRank
  • Stochastic equation
  • Regular variation
  • Web
  • Tauberian theorem

Fingerprint Dive into the research topics of 'Asymptotic analysis for personalized web search'. Together they form a unique fingerprint.

  • Cite this