Efficient Algorithms for Approximate Single-Source Personalized PageRank Queries

Sibo Wang, Renchi Yang, Runhui Wang +5

Given a graph $G$, a source node $s$ and a target node $t$, the personalized PageRank (PPR) of $t$ with respect to $s$ is the probability that a random walk starting from $s$ termi…