Walk, Not Wait: Faster Sampling Over Online Social Networks
Summary: WALK-ESTIMATE avoids long, topology-dependent burn-in for local-query social-network sampling. A backward random walk provides unbiased sampling-probability estimates, enabling acceptance–rejection correction after short walks to the target distribution. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Azade Nazi (University of Texas)
- 2. Zhuojie Zhou (George Washington University)
- 3. Saravanan Thirumuruganathan (University of Texas)
- 4. Nan Zhang (George Washington University)
- 5. Gautam Das (University of Texas)
BibTeX Citation
@article{nazi_vldb15,
title = {{Walk, Not Wait: Faster Sampling Over Online Social Networks}},
author = {Nazi, Azade and Zhou, Zhuojie and Thirumuruganathan, Saravanan and Zhang, Nan and Das, Gautam},
journal = {PVLDB},
series = {{VLDB} '15},
volume = {8},
number = {6},
pages = {678--689},
doi = {10.14778/2735703.2735707},
url = {https://doi.org/10.14778/2735703.2735707},
year = {2015}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,473 | Efficiently Answering Regular Simple Path Queries on Large Labeled Networks | 2019 | SIGMOD | 7.3864987e-05 |
| 6,423 | Memory-Aware Framework for Efficient Second-Order Random Walk on Large Graphs | 2020 | SIGMOD | 5.8813146e-05 |
| 11,792 | Optimizing Item and Subgroup Configurations for Social-Aware VR Shopping | 2020 | VLDB | 5.093636e-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,868 | A Random Walk Approach to Sampling Hidden Databases | 2007 | SIGMOD | 6.0613238e-05 |
| 9,651 | Exploration of Deep Web Repositories | 2011 | VLDB | 5.2427667e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,062 | Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches | 2023 | SIGMOD |
| 2 | 7,255 | Space-Efficient Random Walks on Streaming Graphs | 2023 | VLDB |
| 3 | 5,868 | A Random Walk Approach to Sampling Hidden Databases | 2007 | SIGMOD |
| 4 | 1,396 | Estimating PageRank on Graph Streams | 2008 | PODS |
| 5 | 556 | Fast Incremental and Personalized PageRank | 2011 | VLDB |
| 6 | 4,572 | On the Embeddability of Random Walk Distances | 2013 | VLDB |
| 7 | 8,054 | Approximating Aggregate Queries about Web Pages via Random Walks | 2000 | VLDB |
| 8 | 6,423 | Memory-Aware Framework for Efficient Second-Order Random Walk on Large Graphs | 2020 | SIGMOD |
| 9 | 1,958 | A General Framework for Estimating Graphlet Statistics via Random Walk | 2017 | VLDB |
| 10 | 4,497 | Leveraging History for Faster Sampling of Online Social Networks | 2015 | VLDB |