Back to papers
Efficient Approximation of Kemeny’s Constant for Large Graphs
Summary: Scalable approximation of Kemeny’s constant for massive graphs via two Monte Carlo methods. RefinedMC trims redundant truncated random walks; ForestMC leverages a Laplacian-submatrix / forest-based identity for higher-accuracy estimation, avoiding explicit matrix inversion.
(summarized by gpt-5.4-mini on May 24 2026)
- Paper ID
- 6899
- Venue
- SIGMOD
- Year
- 2024
- Pagerank
- 4.1945683e-05
- Overall Rank
- 10,958 | 23.77%
- DOI
-
10.1145/3654937
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
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.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 2,827 |
Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push |
2021 |
SIGMOD |
8.0551884e-05 |
| 4,527 |
On the Embeddability of Random Walk Distances |
2013 |
VLDB |
6.1083926e-05 |
| 4,562 |
Massively Parallel Algorithms for Personalized PageRank |
2021 |
VLDB |
6.0846728e-05 |
| 5,015 |
Challenging the Long Tail Recommendation |
2012 |
VLDB |
5.7584513e-05 |
| 5,110 |
LightNE: A Lightweight Graph Processing System for Network Embedding |
2021 |
SIGMOD |
5.6901951e-05 |
| 5,655 |
Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme |
2023 |
SIGMOD |
5.387631e-05 |
| 5,763 |
Localizing Anomalous Changes in Time-evolving Graphs |
2014 |
SIGMOD |
5.3369426e-05 |
| 6,093 |
Density-based Place Clustering in Geo-Social Networks |
2014 |
SIGMOD |
5.2131159e-05 |
| 6,381 |
Edge-based Local Push for Personalized PageRank |
2022 |
VLDB |
5.0890757e-05 |
| 7,924 |
Distributed Graph Embedding with Information-Oriented Random Walks |
2023 |
VLDB |
4.6154072e-05 |
| 8,512 |
Network Shuffling: Privacy Amplification via Random Walks |
2022 |
SIGMOD |
4.4947966e-05 |
| 9,245 |
Efficient Resistance Distance Computation: the Power of Landmark-based Approaches |
2023 |
SIGMOD |
4.3690661e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 5,702 |
Efficient Estimation of Heat Kernel PageRank for Local Clustering |
2019 |
SIGMOD |
5.36473e-05 |
| 3,636 |
Efficient and Effective Algorithms for Clustering Uncertain Graphs |
2019 |
VLDB |
6.8976555e-05 |
| 11,164 |
Node-Differentially Private Estimation of the Number of Connected Components |
2023 |
PODS |
4.1945683e-05 |
| 2,108 |
Leveraging History for Faster Sampling of Online Social Networks |
2015 |
VLDB |
9.5327714e-05 |
| 7,394 |
Efficient Estimation of Pairwise Effective Resistance |
2023 |
SIGMOD |
4.7427524e-05 |
| 6,498 |
Memory-Aware Framework for Efficient Second-Order Random Walk on Large Graphs |
2020 |
SIGMOD |
5.0392468e-05 |
| 9,406 |
Efficient k-Clique Count Estimation with Accuracy Guarantee |
2024 |
VLDB |
4.3441378e-05 |
| 9,239 |
Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs |
2024 |
VLDB |
4.3690661e-05 |
| 9,325 |
Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches |
2023 |
SIGMOD |
4.3556432e-05 |
| 1,740 |
A General Framework for Estimating Graphlet Statistics via Random Walk |
2017 |
VLDB |
0.0001071792 |