Efficient Estimation of Heat Kernel PageRank for Local Clustering
Summary: TEA and TEA+: HKPR-based local clustering with relative-error guarantees and near-linear time in cluster size, via deterministic rough HKPR and Monte Carlo refinement. TEA+ beats prior methods ~4x on real graphs (Twitter, Friendster), enabling scalable clustering on billion-edge networks. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Renchi Yang
- 2. Xiaokui Xiao
- 3. Zhewei Wei
- 4. Sourav S Bhowmick
- 5. Jun Zhao
- 6. Rong-Hua Li
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,381 | Edge-based Local Push for Personalized PageRank | 2022 | VLDB | 5.0890757e-05 |
| 7,394 | Efficient Estimation of Pairwise Effective Resistance | 2023 | SIGMOD | 4.7427524e-05 |
| 7,446 | QTCS: Efficient Query-Centered Temporal Community Search | 2024 | VLDB | 4.727813e-05 |
| 9,328 | Estimating Single-Node PageRank in O~(min{d_t, sqrt(m)}) Time | 2023 | VLDB | 4.3556432e-05 |
| 10,028 | One Index for All: Towards Efficient Personalized PageRank Computation for Every Damping Factor | 2026 | SIGMOD | 4.1945683e-05 |
| 10,861 | Finding Time-Proximity Communities in Temporal Heterogeneous Information Networks | 2025 | VLDB | 4.1945683e-05 |
| 10,920 | Optimal Dynamic Parameterized Subset Sampling | 2024 | PODS | 4.1945683e-05 |
| 10,957 | Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach | 2024 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 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,049 | Community Detection in Social Networks: An In-depth Benchmarking Study with a Procedure-Oriented Framework | 2015 | VLDB | 9.6894639e-05 |
| 2,242 | HubPPR: Effective Indexing for Approximate Personalized PageRank | 2017 | VLDB | 9.218875e-05 |
| 3,597 | Parallel Local Graph Clustering | 2016 | VLDB | 6.9345175e-05 |
| 4,733 | TopPPR: Top-k Personalized PageRank Queries with Precision Guarantees on Large Graphs | 2018 | SIGMOD | 5.9631943e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,108 | Leveraging History for Faster Sampling of Online Social Networks | 2015 | VLDB | 9.5327714e-05 |
| 777 | Local Graph Sparsification for Scalable Clustering | 2011 | SIGMOD | 0.0001679862 |
| 6,309 | Efficient Algorithms for Finding Approximate Heavy Hitters in Personalized PageRanks | 2018 | SIGMOD | 5.1167347e-05 |
| 886 | Fast Personalized PageRank on MapReduce | 2011 | SIGMOD | 0.00015597161 |
| 595 | Estimating PageRank on Graph Streams | 2008 | PODS | 0.00019507721 |
| 7,086 | Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach | 2022 | SIGMOD | 4.8381004e-05 |
| 9,328 | Estimating Single-Node PageRank in O~(min{d_t, sqrt(m)}) Time | 2023 | VLDB | 4.3556432e-05 |
| 486 | Fast Incremental and Personalized PageRank | 2011 | VLDB | 0.00022068545 |
| 9,214 | Efficient and Accurate PageRank Approximation on Large Graphs | 2024 | SIGMOD | 4.3716847e-05 |
| 9,325 | Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches | 2023 | SIGMOD | 4.3556432e-05 |