Estimating Single-Node PageRank in O~(min{d_t, sqrt(m)}) Time
Summary: SetPush: a novel algorithm for single-node PageRank on undirected graphs that yields constant-relative-error estimates in O~(min{d_t, sqrt(m)}) time with constant failure probability. Breaks the O(n) worst-case of Monte Carlo/backward-push via a tailored push scheme and analysis; validated empirically. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Hanzhi Wang
- 2. Zhewei Wei
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,027 | BIRD: Efficient Approximation of Bidirectional Hidden Personalized PageRank | 2024 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 320 | ObjectRank: Authority-Based Keyword Search in Databases | 2004 | VLDB | 0.00027577867 |
| 486 | Fast Incremental and Personalized PageRank | 2011 | VLDB | 0.00022068545 |
| 4,733 | TopPPR: Top-k Personalized PageRank Queries with Precision Guarantees on Large Graphs | 2018 | SIGMOD | 5.9631943e-05 |
| 5,702 | Efficient Estimation of Heat Kernel PageRank for Local Clustering | 2019 | SIGMOD | 5.36473e-05 |
| 8,236 | PRSim: Sublinear Time SimRank Computation on Large Power-Law Graphs | 2019 | SIGMOD | 4.553296e-05 |
Previous
Page 1 / 1
Next