2 papers
cs.DS2024
Dynamic PageRank: Algorithms and Lower Bounds
Rajesh Jayaram, Jakub Łącki, Slobodan Mitrović +2
We consider the PageRank problem in the dynamic setting, where the goal is to explicitly maintain an approximate PageRank vector for a graph under a sequence of…
cs.DS2019
Walking Randomly, Massively, and Efficiently
Jakub Łącki, Slobodan Mitrović, Krzysztof Onak +1
We introduce a set of techniques that allow for efficiently generating many independent random walks in the Massive Parallel Computation (MPC) model with space per machine strongly…