On the complexity of the Monte Carlo method for incremental PageRank

DOI10.1016/J.IPL.2013.11.006MaRDI QIDQ2445397zbMATH OpenOpenAlexFDO

Authors Peter Lofgren

Publication date 14 April 2014

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1204.5500

zbMATH Keywords

analysis of algorithmsgraph algorithmsMonte Carlo PageRank

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Searching and sorting (68P10) Random walks on graphs (05C81) Internet topics (68M11)

Abstract: This note extends the analysis of incremental PageRank in [B. Bahmani, A. Chowdhury, and A. Goel. Fast Incremental and Personalized PageRank. VLDB 2011]. In that work, the authors prove a running time of $O(fracnRepsilo{n}^{2}ln(m))$ to keep PageRank updated over $m$ edge arrivals in a graph with $n$ nodes when the algorithm stores $R$ random walks per node and the PageRank teleport probability is $epsilon$. To prove this running time, they assume that edges arrive in a random order, and leave it to future work to extend their running time guarantees to adversarial edge arrival. In this note, we show that the random edge order assumption is necessary by exhibiting a graph and adversarial edge arrival order in which the running time is $Omegaleft(Rn{m}^{lgfrac32(1-epsilon)}ight)$. More generally, for any integer $dgeq2$, we construct a graph and adversarial edge order in which the running time is $Omegaleft(Rn{m}^{lo{g}_d(H_d(1-epsilon))}ight)$, where $H_d$ is the $d$th harmonic number.

Recommendations

• A sublinear time algorithm for PageRank computations
• Estimating PageRank on graph streams
• Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
• The Computational Complexity of Link Building
• Paradoxical Effects in PageRank Incremental Computations

Cites work

• Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient

Cited in

(1)

• Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient

This page was built for publication: On the complexity of the Monte Carlo method for incremental PageRank

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2445397)