Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach
Summary: Introduces spanning-forests sampling for personalized PageRank via loop-erased alpha-random walks, grounded in a new matrix forest theorem. Alpha-insensitive, fast single-source and single-target PPR queries; outperforms prior methods with experiments on seven large real-world graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Meihao Liao (Beijing Institute of Technology)
- 2. Rong-Hua Li (Beijing Institute of Technology)
- 3. Qiangqiang Dai (Beijing Institute of Technology)
- 4. Guoren Wang (Beijing Institute of Technology)
BibTeX Citation
@inproceedings{liao_sigmod22,
title = {{Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach}},
author = {Liao, Meihao and Li, Rong-Hua and Dai, Qiangqiang and Wang, Guoren},
series = {{SIGMOD} '22},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3514221.3526140},
url = {https://dl.acm.org/doi/10.1145/3514221.3526140},
year = {2022}
}
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 12 of 12 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,859 | Efficient Algorithms for Finding Approximate Heavy Hitters in Personalized PageRanks | 2018 | SIGMOD |
| 2 | 5,236 | Edge-based Local Push for Personalized PageRank | 2022 | VLDB |
| 3 | 1,415 | Estimating PageRank on Graph Streams | 2008 | PODS |
| 4 | 3,266 | Distributed Algorithms on Exact Personalized PageRank | 2017 | SIGMOD |
| 5 | 962 | Fast Personalized PageRank on MapReduce | 2011 | SIGMOD |
| 6 | 2,393 | Incremental and Accuracy-Aware Personalized PageRank through Scheduled Approximation | 2013 | VLDB |
| 7 | 9,220 | One Index for All: Towards Efficient Personalized PageRank Computation for Every Damping Factor | 2026 | SIGMOD |
| 8 | 1,368 | Computing Personalized PageRank Quickly by Exploiting Graph Structures | 2014 | VLDB |
| 9 | 4,264 | Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme | 2023 | SIGMOD |
| 10 | 8,226 | Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches | 2023 | SIGMOD |