Efficient and Accurate PageRank Approximation on Large Graphs
Summary: CUR-Trans lowers PageRank time with tighter error bounds via matrix-approximation. T^2-Approx further reduces runtime while providing PageRank estimates for all vertices with competitive accuracy, validated on three large graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Siyue Wu
- 2. Dingming Wu
- 3. Junyi Quan
- 4. Tsz Nam Chan
- 5. Kezhong Lu
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,929 | Optimal Approximate Matrix Multiplication over Sliding Windows | 2026 | VLDB | 4.613363e-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 |
|---|---|---|---|---|
| 886 | Fast Personalized PageRank on MapReduce | 2011 | SIGMOD | 0.00015597161 |
| 4,562 | Massively Parallel Algorithms for Personalized PageRank | 2021 | VLDB | 6.0846728e-05 |
| 6,309 | Efficient Algorithms for Finding Approximate Heavy Hitters in Personalized PageRanks | 2018 | SIGMOD | 5.1167347e-05 |
| 6,381 | Edge-based Local Push for Personalized PageRank | 2022 | VLDB | 5.0890757e-05 |
| 7,086 | Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach | 2022 | SIGMOD | 4.8381004e-05 |
Previous
Page 1 / 1
Next