An efficient Monte Carlo approach to compute PageRank for large graphs on a single PC

DOI10.1515/fcds-2016-0002zbMath1334.68162OpenAlexW2335270437MaRDI QIDQ275525

Tomohiro Sonobe

Publication date: 26 April 2016

Published in: Foundations of Computing and Decision Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/fcds-2016-0002

zbMATH Keywords

graphMonte Carlorandom walkPageRank

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Monte Carlo methods (65C05) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Internet topics (68M11) Random walks on graphs (05C81)

Uses Software

• Pregel
• GeneRank
• WebGraph
• GraphChi

Cites Work

• Unnamed Item
• Fast distributed PageRank computation
• Adaptive methods for the computation of PageRank
• Estimating PageRank on graph streams
• Algorithms and Models for the Web-Graph
• Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
• Parallelizing the Computation of PageRank

This page was built for publication: An efficient Monte Carlo approach to compute PageRank for large graphs on a single PC