Asymptotic analysis for personalized Web search

Share/Save/Bookmark

Volkovich, Y.V. and Litvak, N. (2008) Asymptotic analysis for personalized Web search. [Report] (In Press)

open access
[img]
Preview
PDF
1MB
Abstract:Personalized PageRank 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\stackrel{d}{=}\sum_{i=1}^NA_iR_i+B$, where $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 of 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 a good agreement with experimental data.
Item Type:Report
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/65033
Official URL:http://www.math.utwente.nl/publications
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 252054