The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Design of on-line algorithms using hitting times
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Adaptive on-line page importance computation
WWW '03 Proceedings of the 12th international conference on World Wide Web
Dynamic personalized pagerank in entity-relation graphs
Proceedings of the 16th international conference on World Wide Web
Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
SIAM Journal on Numerical Analysis
| Hi-index | 0.00 |
Algorithms for ranking of web pages such as Google Page-Rank assign importance scores according to a stationary distribution of a Markov random walk on the web graph. Although in the classical search scheme the ranking scores are pre-computed off-line, several challenging problems in contemporary web search, such as personalized search and search in entity graphs, require on-line PageRank computation. In this work we present a probabilistic point of view for an original on-line algorithm proposed by Abiteboul, Preda and Cobena [1]. According to this algorithm, at the beginning, each page receives an equal amount of 'cash', and every time when a page is visited by a random walk, it distributes its cash among its outgoing links. The PageRank score of a page is then proportional to the amount of cash transferred from this page. In this paper, instead of dealing with the variable 'cash', which is continuous, we create a two-dimensional discrete 'cat and mouse' Markov chain such that the amount of cash on each page can be expressed via probabilities for this new Markov chain. We also indicate further research directions, such as the analysis of the cat and mouse chain in the case when the cat's movements are described by a classical stochastic process such as the M/M/1 random walk.