Efficient Estimation of Pairwise Effective Resistance
Summary: AMC: improved Monte Carlo estimation reduces random-walk length and count with adaptive sampling while preserving accuracy. GEER: a greedy framework that pairs AMC with sparse mat-vecs for dramatic practical speedups, maintaining asymptotic guarantees. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Renchi Yang (Hong Kong Baptist University)
- 2. Jing Tang (Hong Kong University of Science and Technology)
BibTeX Citation
@inproceedings{yang_sigmod23,
title = {{Efficient Estimation of Pairwise Effective Resistance}},
author = {Yang, Renchi and Tang, Jing},
series = {{SIGMOD} '23},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3588696},
url = {https://dl.acm.org/doi/10.1145/3588696},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,655 | Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach | 2024 | SIGMOD | 5.2794257e-05 |
| 9,988 | Efficient Index Maintenance for Effective Resistance Computation on Evolving Graphs | 2025 | SIGMOD | 5.0845476e-05 |
| 10,414 | Tree+DAG: An Efficient Index for Resistance Distance Computation on Core-Periphery Graphs | 2027 | SIGMOD | 4.9605343e-05 |
| 10,532 | Fast Estimation of Pairwise Biharmonic Distance on Graphs | 2026 | SIGMOD | 4.9605343e-05 |
| 10,638 | Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach | 2026 | SIGMOD | 4.9605343e-05 |
| 10,813 | Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs | 2026 | VLDB | 4.9605343e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 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,089 | Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push | 2021 | SIGMOD | 9.0473016e-05 |
| 2,188 | HubPPR: Effective Indexing for Approximate Personalized PageRank | 2017 | VLDB | 8.8879472e-05 |
| 3,657 | Realtime Top-k Personalized PageRank over Large Graphs on GPUs | 2020 | VLDB | 7.1105244e-05 |
| 4,097 | TopPPR: Top-k Personalized PageRank Queries with Precision Guarantees on Large Graphs | 2018 | SIGMOD | 6.7946571e-05 |
| 4,356 | Challenging the Long Tail Recommendation | 2012 | VLDB | 6.630005e-05 |
| 4,630 | On the Embeddability of Random Walk Distances | 2013 | VLDB | 6.4789067e-05 |
| 4,654 | LightNE: A Lightweight Graph Processing System for Network Embedding | 2021 | SIGMOD | 6.4694415e-05 |
| 4,739 | Density-based Place Clustering in Geo-Social Networks | 2014 | SIGMOD | 6.4295168e-05 |
| 5,319 | Localizing Anomalous Changes in Time-evolving Graphs | 2014 | SIGMOD | 6.1676262e-05 |
| 6,047 | Efficient Estimation of Heat Kernel PageRank for Local Clustering | 2019 | SIGMOD | 5.8870311e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,630 | On the Embeddability of Random Walk Distances | 2013 | VLDB |
| 2 | 10,532 | Fast Estimation of Pairwise Biharmonic Distance on Graphs | 2026 | SIGMOD |
| 3 | 9,685 | Efficient Approximation of Kemeny’s Constant for Large Graphs | 2024 | SIGMOD |
| 4 | 5,579 | Scalable and Effective Bipartite Network Embedding | 2022 | SIGMOD |
| 5 | 10,813 | Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs | 2026 | VLDB |
| 6 | 9,988 | Efficient Index Maintenance for Effective Resistance Computation on Evolving Graphs | 2025 | SIGMOD |
| 7 | 6,047 | Efficient Estimation of Heat Kernel PageRank for Local Clustering | 2019 | SIGMOD |
| 8 | 8,251 | Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches | 2023 | SIGMOD |
| 9 | 8,655 | Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach | 2024 | SIGMOD |
| 10 | 8,008 | Efficient Resistance Distance Computation: the Power of Landmark-based Approaches | 2023 | SIGMOD |