A survey on distributed approaches to graph based reputation measures
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Probabilistic Relation between In-Degree and PageRank
Algorithms and Models for the Web-Graph
Analysis of an on-line algorithm for solving large Markov chains
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Distributed PageRank computation with link failures
ACC'09 Proceedings of the 2009 conference on American Control Conference
Distribution of PageRank mass among principle components of the web
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Manipulation-resistant reputations using hitting time
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
An Arnoldi-Extrapolation algorithm for computing PageRank
Journal of Computational and Applied Mathematics
k-nearest neighbors in uncertain graphs
Proceedings of the VLDB Endowment
Fast incremental and personalized PageRank
Proceedings of the VLDB Endowment
Fast personalized PageRank on MapReduce
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Quick detection of top-k personalized pagerank lists
WAW'11 Proceedings of the 8th international conference on Algorithms and models for the web graph
Multiplicative approximations of random walk transition probabilities
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
A sublinear time algorithm for pagerank computations
WAW'12 Proceedings of the 9th international conference on Algorithms and Models for the Web Graph
LBSNRank: personalized pagerank on location-based social networks
Proceedings of the 2012 ACM Conference on Ubiquitous Computing
A survey on proximity measures for social networks
Search Computing
On the embeddability of random walk distances
Proceedings of the VLDB Endowment
On the complexity of the Monte Carlo method for incremental PageRank
Information Processing Letters
A Monte Carlo algorithm for cold start recommendation
Proceedings of the 23rd international conference on World wide web
Accelerating the Arnoldi-Type Algorithm for the PageRank Problem and the ProteinRank Problem
Journal of Scientific Computing
| Hi-index | 0.01 |
PageRank is one of the principle criteria according to which Google ranks Web pages. PageRank can be interpreted as a frequency of visiting a Web page by a random surfer, and thus it reflects the popularity of a Web page. Google computes the PageRank using the power iteration method, which requires about one week of intensive computations. In the present work we propose and analyze Monte Carlo-type methods for the PageRank computation. There are several advantages of the probabilistic Monte Carlo methods over the deterministic power iteration method: Monte Carlo methods already provide good estimation of the PageRank for relatively important pages after one iteration; Monte Carlo methods have natural parallel implementation; and finally, Monte Carlo methods allow one to perform continuous update of the PageRank as the structure of the Web changes.