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
- 2. Rong-Hua Li
- 3. Qiangqiang Dai
- 4. Guoren Wang
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,446 | QTCS: Efficient Query-Centered Temporal Community Search | 2024 | VLDB | 4.727813e-05 |
| 9,214 | Efficient and Accurate PageRank Approximation on Large Graphs | 2024 | SIGMOD | 4.3716847e-05 |
| 9,245 | Efficient Resistance Distance Computation: the Power of Landmark-based Approaches | 2023 | SIGMOD | 4.3690661e-05 |
| 9,325 | Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches | 2023 | SIGMOD | 4.3556432e-05 |
| 9,484 | Enabling Window-Based Monotonic Graph Analytics with Reusable Transitional Results for Pattern-Consistent Queries | 2024 | VLDB | 4.3341665e-05 |
| 9,642 | Efficient Index Maintenance for Effective Resistance Computation on Evolving Graphs | 2025 | SIGMOD | 4.3109001e-05 |
| 10,028 | One Index for All: Towards Efficient Personalized PageRank Computation for Every Damping Factor | 2026 | SIGMOD | 4.1945683e-05 |
| 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 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