Edge-based Local Push for Personalized PageRank
Summary: EdgePush uses edge-based push for SSPPR in weighted graphs, distributing mass per edge rather than to neighbors. Per-edge termination yields tighter bounds, beating LocalPush by up to O(n) in query cost; shown on motif-based and real weighted graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Hanzhi Wang
- 2. Zhewei Wei
- 3. Junhao Gan
- 4. Ye Yuan
- 5. Xiaoyong Du
- 6. Ji-Rong Wen
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,709 | Zebra: When Temporal Graph Neural Networks Meet Temporal Personalized PageRank | 2023 | VLDB | 6.8242482e-05 |
| 9,214 | Efficient and Accurate PageRank Approximation on Large Graphs | 2024 | SIGMOD | 4.3716847e-05 |
| 10,958 | Efficient Approximation of Kemeny’s Constant for Large Graphs | 2024 | SIGMOD | 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 |
|---|---|---|---|---|
| 2,242 | HubPPR: Effective Indexing for Approximate Personalized PageRank | 2017 | VLDB | 9.218875e-05 |
| 2,827 | Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push | 2021 | SIGMOD | 8.0551884e-05 |
| 4,562 | Massively Parallel Algorithms for Personalized PageRank | 2021 | VLDB | 6.0846728e-05 |
| 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 |
Previous
Page 1 / 1
Next