Remember Where You Came From: On The Second-Order Random Walk Based Proximity Measures
Summary: Second-order proximity via edge-to-edge transitions with incidence matrices captures history-aware similarity beyond first-order methods. Degenerates to first-order when past-step influence is zero; Monte Carlo with guarantees yields gains on graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yubao Wu (Case Western Reserve University)
- 2. Yuchen Bian (Case Western Reserve University)
- 3. Xiang Zhang (Case Western Reserve University)
BibTeX Citation
@article{wu_vldb17,
title = {{Remember Where You Came From: On The Second-Order Random Walk Based Proximity Measures}},
author = {Wu, Yubao and Bian, Yuchen and Zhang, Xiang},
journal = {PVLDB},
series = {{VLDB} '17},
volume = {10},
number = {1},
pages = {13},
doi = {10.14778/3015270.3015272},
url = {https://doi.org/10.14778/3015270.3015272},
year = {2017}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,358 | Anchored Densest Subgraph | 2022 | SIGMOD | 6.6402693e-05 |
| 6,301 | Memory-Aware Framework for Efficient Second-Order Random Walk on Large Graphs | 2020 | SIGMOD | 5.8188746e-05 |
| 7,263 | An I/O-Efficient Disk-based Graph System for Scalable Second-Order Random Walk of Large Graphs | 2022 | VLDB | 5.5711876e-05 |
| 11,564 | FlowWalker: A Memory-efficient and High-performance GPU-based Dynamic Graph Random Walk Framework | 2024 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 830 | Robust Local Community Detection: On Free Rider Effect and Its Elimination | 2015 | VLDB | 0.00013605481 |
| 1,400 | Scalable Similarity Search for SimRank | 2014 | SIGMOD | 0.00010776946 |
| 1,626 | More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks | 2014 | VLDB | 0.00010043754 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,031 | READS: A Random Walk Approach for Efficient and Accurate Dynamic SimRank | 2017 | VLDB |
| 2 | 4,264 | Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme | 2023 | SIGMOD |
| 3 | 11,517 | Efficient Approximation of Kemeny’s Constant for Large Graphs | 2024 | SIGMOD |
| 4 | 8,226 | Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches | 2023 | SIGMOD |
| 5 | 8,020 | Efficient Resistance Distance Computation: the Power of Landmark-based Approaches | 2023 | SIGMOD |
| 6 | 7,263 | An I/O-Efficient Disk-based Graph System for Scalable Second-Order Random Walk of Large Graphs | 2022 | VLDB |
| 7 | 1,940 | A General Framework for Estimating Graphlet Statistics via Random Walk | 2017 | VLDB |
| 8 | 4,560 | Leveraging History for Faster Sampling of Online Social Networks | 2015 | VLDB |
| 9 | 4,649 | On the Embeddability of Random Walk Distances | 2013 | VLDB |
| 10 | 6,301 | Memory-Aware Framework for Efficient Second-Order Random Walk on Large Graphs | 2020 | SIGMOD |