Fast Estimation of Pairwise Biharmonic Distance on Graphs
Summary: Introduces pivot-based formulations for pairwise biharmonic distance, enabling BackPush (deterministic), FastWalk (collision-counting truncated absorbing walks), and FastTree (spanning-tree connection). On graphs with hundreds of millions of edges, these methods are >100× faster and more accurate than SOTA. (summarized by gpt-5.6-luna on Jul 26 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Changan Liu (Fudan University)
- 2. Xinna Zhou (Fudan University)
- 3. Bo Zhang (Fudan University)
- 4. Ahad N. Zehmakan (Australian National University)
- 5. Zhongzhi Zhang (Fudan University)
BibTeX Citation
@inproceedings{liu_sigmod26,
title = {{Fast Estimation of Pairwise Biharmonic Distance on Graphs}},
author = {Liu, Changan and Zhou, Xinna and Zhang, Bo and Zehmakan, Ahad N. and Zhang, Zhongzhi},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3802058},
url = {https://dl.acm.org/doi/10.1145/3802058},
year = {2026}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 195 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD | 0.00025813775 |
| 1,339 | Computing Personalized PageRank Quickly by Exploiting Graph Structures | 2014 | VLDB | 0.00011112799 |
| 1,613 | When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks | 2018 | SIGMOD | 0.00010216983 |
| 2,225 | HubPPR: Effective Indexing for Approximate Personalized PageRank | 2017 | VLDB | 8.9183159e-05 |
| 4,272 | Challenging the Long Tail Recommendation | 2012 | VLDB | 6.7911017e-05 |
| 5,157 | Efficient Estimation of Pairwise Effective Resistance | 2023 | SIGMOD | 6.3409526e-05 |
| 7,861 | Efficient Resistance Distance Computation: the Power of Landmark-based Approaches | 2023 | SIGMOD | 5.5302333e-05 |
| 8,911 | Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach | 2024 | SIGMOD | 5.3483178e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,598 | Scalable Approximate Biclique Counting over Large Bipartite Graphs | 2026 | VLDB |
| 2 | 10,560 | Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs | 2026 | VLDB |
| 3 | 10,366 | Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach | 2026 | SIGMOD |
| 4 | 4,216 | An Efficient Similarity Search Framework for SimRank over Large Dynamic Graphs | 2015 | VLDB |
| 5 | 7,255 | Space-Efficient Random Walks on Streaming Graphs | 2023 | VLDB |
| 6 | 7,211 | Toward a Distance Oracle for Billion-Node Graphs | 2014 | VLDB |
| 7 | 1,628 | Fast and Unified Local Search for Random Walk Based K-Nearest-Neighbor Query in Large Graphs | 2014 | SIGMOD |
| 8 | 195 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD |
| 9 | 4,572 | On the Embeddability of Random Walk Distances | 2013 | VLDB |
| 10 | 7,861 | Efficient Resistance Distance Computation: the Power of Landmark-based Approaches | 2023 | SIGMOD |