BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs
Summary: BEAR reorders the graph adjacency to expose a large invertible block and precomputes its Schur complement for scalable RWR. During queries, it uses block-elimination to compute RWR quickly, and beats prior methods in preprocessing, space, and accuracy. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Kijung Shin (Seoul National University)
- 2. Jinhong Jung (Korea Advanced Institute of Science and Technology)
- 3. Lee Sael (State University of New York Korea)
- 4. U Kang (Korea Advanced Institute of Science and Technology)
BibTeX Citation
@inproceedings{shin_sigmod15,
title = {{BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs}},
author = {Shin, Kijung and Jung, Jinhong and Sael, Lee and Kang, U},
series = {{SIGMOD} '15},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2723372.2723716},
url = {https://dl.acm.org/doi/10.1145/2723372.2723716},
year = {2015}
}
Incoming Citations (Sorted by Pagerank)
Showing 17 of 17 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 285 | ObjectRank: Authority-Based Keyword Search in Databases | 2004 | VLDB | 0.00022365284 |
| 758 | Simrank++: Query Rewriting through Link Analysis of the Click Graph | 2008 | VLDB | 0.00014277369 |
| 1,414 | Fast and Exact Top-k Search for Random Walk with Restart | 2012 | VLDB | 0.00010848387 |
| 1,628 | Fast and Unified Local Search for Random Walk Based K-Nearest-Neighbor Query in Large Graphs | 2014 | SIGMOD | 0.00010186757 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,414 | Fast and Exact Top-k Search for Random Walk with Restart | 2012 | VLDB |
| 2 | 10,240 | Fast Estimation of Pairwise Biharmonic Distance on Graphs | 2026 | SIGMOD |
| 3 | 4,572 | On the Embeddability of Random Walk Distances | 2013 | VLDB |
| 4 | 8,911 | Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach | 2024 | SIGMOD |
| 5 | 4,216 | An Efficient Similarity Search Framework for SimRank over Large Dynamic Graphs | 2015 | VLDB |
| 6 | 7,201 | An I/O-Efficient Disk-based Graph System for Scalable Second-Order Random Walk of Large Graphs | 2022 | VLDB |
| 7 | 6,423 | Memory-Aware Framework for Efficient Second-Order Random Walk on Large Graphs | 2020 | SIGMOD |
| 8 | 3,951 | READS: A Random Walk Approach for Efficient and Accurate Dynamic SimRank | 2017 | VLDB |
| 9 | 5,815 | Reverse Top-k Search using Random Walk with Restart | 2014 | VLDB |
| 10 | 2,073 | BePI: Fast and Memory-Efficient Method for Billion-Scale Random Walk with Restart | 2017 | SIGMOD |