Walk, Not Wait: Faster Sampling Over Online Social Networks
Summary: Walk-ESTIMATE starts with a short random walk, then uses a backward-walk estimator and acceptance-rejection to reach the target distribution faster. Provably unbiased, it outperforms traditional RW in theory and on real OSNs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Azade Nazi
- 2. Zhuojie Zhou
- 3. Saravanan Thirumuruganathan
- 4. Nan Zhang
- 5. Gautam Das
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,191 | Efficiently Answering Regular Simple Path Queries on Large Labeled Networks | 2019 | SIGMOD | 6.3676619e-05 |
| 6,493 | Memory-Aware Framework for Efficient Second-Order Random Walk on Large Graphs | 2020 | SIGMOD | 5.0344095e-05 |
| 11,601 | Optimizing Item and Subgroup Configurations for Social-Aware VR Shopping | 2020 | VLDB | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,141 | A Random Walk Approach to Sampling Hidden Databases | 2007 | SIGMOD | 5.6627467e-05 |
| 9,438 | Exploration of Deep Web Repositories | 2011 | VLDB | 4.3390134e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,330 | Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches | 2023 | SIGMOD | 4.351469e-05 |
| 7,212 | Space-Efficient Random Walks on Streaming Graphs | 2023 | VLDB | 4.7943898e-05 |
| 5,141 | A Random Walk Approach to Sampling Hidden Databases | 2007 | SIGMOD | 5.6627467e-05 |
| 589 | Estimating PageRank on Graph Streams | 2008 | PODS | 0.00019569121 |
| 478 | Fast Incremental and Personalized PageRank | 2011 | VLDB | 0.00022183187 |
| 4,487 | On the Embeddability of Random Walk Distances | 2013 | VLDB | 6.1412716e-05 |
| 7,716 | Approximating Aggregate Queries about Web Pages via Random Walks | 2000 | VLDB | 4.664328e-05 |
| 6,493 | Memory-Aware Framework for Efficient Second-Order Random Walk on Large Graphs | 2020 | SIGMOD | 5.0344095e-05 |
| 1,724 | A General Framework for Estimating Graphlet Statistics via Random Walk | 2017 | VLDB | 0.00010736699 |
| 2,102 | Leveraging History for Faster Sampling of Online Social Networks | 2015 | VLDB | 9.5379264e-05 |