Name
Abstract | ||
|---|---|---|
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 worst-case choice of source and target nodes. Our work builds on a recent line of work on bidirectional estimators for PPR, which obtained sublinear running-time guarantees but in an average-case sense, for a uniformly random choice of target node. Crucially, we show how the reversibility of random walks on undirected networks can be exploited to convert average-case to worst-case guarantees. While past bidirectional methods combine forward random walks with reverse local pushes, our algorithm combines forward local pushes with reverse random walks. We also discuss how to modify our methods to estimate random-walk probabilities for any length distribution, thereby obtaining fast algorithms for estimating general graph diffusions, including the heat kernel, on undirected networks. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-26784-5_13 | Workshop on Algorithms and Models for the Web-Graph |
Field | DocType | Volume |
Length distribution,Sublinear function,Graph,PageRank,Combinatorics,Computer science,Random walk,Heat kernel,Estimator | Journal | abs/1507.08705 |
ISSN | Citations | PageRank |
0302-9743 | 8 | 0.49 |
References | Authors | |
17 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter Lofgren | 1 | 213 | 9.30 |
| Siddhartha Banerjee | 2 | 185 | 22.85 |
| Ashish Goel | 3 | 3039 | 244.56 |