On the Embeddability of Random Walk Distances
Summary: Proposes a per-node property-aware graph embedding for accurate estimation of random-walk distances (hitting/commute time, PPR); shows standard graph coordinate systems misestimate these metrics. After embedding, node queries run in ~8 μs, enabling orders-of-magnitude speedups with minimal application impact. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Xiaohan Zhao (University of California Santa Barbara)
- 2. Adelbert Chang (University of California Santa Barbara)
- 3. Atish Das Sarma (eBay)
- 4. Haitao Zheng (University of California Santa Barbara)
- 5. Ben Y. Zhao (University of California Santa Barbara)
BibTeX Citation
@article{zhao_vldb13,
title = {{On the Embeddability of Random Walk Distances}},
author = {Zhao, Xiaohan and Chang, Adelbert and Sarma, Atish Das and Zheng, Haitao and Zhao, Ben Y.},
journal = {PVLDB},
series = {{VLDB} '13},
volume = {6},
number = {14},
pages = {1690--1701},
doi = {10.14778/2556549.2556554},
url = {https://doi.org/10.14778/2556549.2556554},
year = {2013}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,628 | Fast and Unified Local Search for Random Walk Based K-Nearest-Neighbor Query in Large Graphs | 2014 | SIGMOD | 0.00010186757 |
| 3,601 | TopoX: Topology Refactorization for Efficient Graph Partitioning and Processing | 2019 | VLDB | 7.27018e-05 |
| 5,157 | Efficient Estimation of Pairwise Effective Resistance | 2023 | SIGMOD | 6.3409526e-05 |
| 11,172 | Efficient Approximation of Kemeny’s Constant for Large Graphs | 2024 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 945 | Fast Personalized PageRank on MapReduce | 2011 | SIGMOD | 0.00013066956 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,284 | Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach | 2022 | SIGMOD |
| 2 | 8,054 | Approximating Aggregate Queries about Web Pages via Random Walks | 2000 | VLDB |
| 3 | 10,240 | Fast Estimation of Pairwise Biharmonic Distance on Graphs | 2026 | SIGMOD |
| 4 | 4,714 | Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme | 2023 | SIGMOD |
| 5 | 7,201 | An I/O-Efficient Disk-based Graph System for Scalable Second-Order Random Walk of Large Graphs | 2022 | VLDB |
| 6 | 6,634 | An Experimental Evaluation of SimRank-based Similarity Search Algorithms | 2017 | VLDB |
| 7 | 7,861 | Efficient Resistance Distance Computation: the Power of Landmark-based Approaches | 2023 | SIGMOD |
| 8 | 1,968 | Homogeneous Network Embedding for Massive Graphs via Reweighted Personalized PageRank | 2020 | VLDB |
| 9 | 3,951 | READS: A Random Walk Approach for Efficient and Accurate Dynamic SimRank | 2017 | VLDB |
| 10 | 7,900 | Distributed Graph Embedding with Information-Oriented Random Walks | 2023 | VLDB |