Bao-Jian Zhou

Accelerated Local Algorithms for Personalized and Regularized PageRank

Local PageRank algorithms seek sparse approximations with work independent of graph size. We give a deterministic algorithm for regularized personalized PageRank with additive objective accuracy $\epsilon$ in $\widetilde{\mathcal{O}}(1/(\rho\sqrt\alpha))$ local work, where $\alpha$ is the lazy teleportation parameter a...