activity
20122025
most citedPersonalized PageRank Estimation and Search: A Bidirectional Approach

120 citations · 222 across the 8 of their papers we have counts for

collaborators
Showing cs.DSShow all

8 papers · 1 filter

cs.DS2016★ 6 cited

Approximate Personalized PageRank on Dynamic Graphs

Hongyang Zhang, Peter Lofgren, Ashish Goel

We propose and analyze two algorithms for maintaining approximate Personalized PageRank (PPR) vectors on a dynamic graph, where edges are added or deleted. Our algorithms are natur…

cs.DS2015★ 23 cited

Efficient Algorithms for Personalized PageRank

Peter Lofgren

We present new, more efficient algorithms for estimating random walk scores such as Personalized PageRank from a given source node to one or several target nodes. These scores are…

cs.DS2015★ 7 cited

Bidirectional PageRank Estimation: From Average-Case to Worst-Case

Peter Lofgren, Siddhartha Banerjee, Ashish Goel

We present a new algorithm for estimating the Personalized PageRank (PPR) between a source and target node on undirected graphs, with sublinear running-time guarantees over the wor…

cs.DS2015★ 120 cited

Personalized PageRank Estimation and Search: A Bidirectional Approach

Peter Lofgren, Siddhartha Banerjee, Ashish Goel

We present new algorithms for Personalized PageRank estimation and Personalized PageRank search. First, for the problem of estimating Personalized PageRank (PPR) from a source dist…

cs.DS2015★ 22 cited

Fast Bidirectional Probability Estimation in Markov Models

Siddhartha Banerjee, Peter Lofgren

We develop a new bidirectional algorithm for estimating Markov chain multi-step transition probabilities: given a Markov chain, we want to estimate the probability of hitting a giv…

cs.DS2014★ 28 cited

FAST-PPR: Scaling Personalized PageRank Estimation for Large Graphs

Peter Lofgren, Siddhartha Banerjee, Ashish Goel +1

We propose a new algorithm, FAST-PPR, for estimating personalized PageRank: given start node and target node in a directed graph, and given a threshold , FAST-PPR estima…

cs.DS2013

Personalized PageRank to a Target Node

Peter Lofgren, Ashish Goel

Personalalized PageRank uses random walks to determine the importance or authority of nodes in a graph from the point of view of a given source node. Much past work has considered…

cs.DS2012★ 9 cited

On the Complexity of the Monte Carlo Method for Incremental PageRank

Peter Lofgren

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…