Back to papers
A General Framework for Estimating Graphlet Statistics via Random Walk
Summary: General framework to estimate graphlet statistics of any size from large graphs via consecutive random-walk samples. Unbiased estimator with Chernoff-Hoeffding sample-size bound and two optimization techniques reduce required samples; experiments show up to an order of magnitude gains in accuracy and time over prior methods.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 11525
- Venue
- VLDB
- Year
- 2017
- Pagerank
- 0.00010736699
- Overall Rank
- 1,724 | 88.02%
- DOI
-
-
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 3,412 |
Motivo: fast motif counting via succinct color coding and adaptive sampling |
2019 |
VLDB |
7.1194524e-05 |
| 5,529 |
Hypergraph Motifs: Concepts, Algorithms, and Discoveries |
2020 |
VLDB |
5.4569473e-05 |
| 6,515 |
Towards Plug-and-Play Visual Graph Query Interfaces: Data-driven Selection of Canned Patterns for Large Networks |
2021 |
VLDB |
5.0270814e-05 |
| 7,317 |
Accurate and Fast Approximate Graph Pattern Mining at Scale |
2025 |
VLDB |
4.7593708e-05 |
| 7,936 |
Fast Local Subgraph Counting |
2024 |
VLDB |
4.6089395e-05 |
| 8,809 |
Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks |
2024 |
VLDB |
4.4401156e-05 |
| 10,288 |
AGIS: Fast Approximate Graph Pattern Mining with Structure-Informed Sampling |
2026 |
VLDB |
4.1905499e-05 |
| 10,951 |
gSWORD: GPU-accelerated Sampling for Subgraph Counting |
2024 |
SIGMOD |
4.1905499e-05 |
| 11,496 |
On Analyzing Graphs with Motif-Paths |
2021 |
VLDB |
4.1905499e-05 |
| 11,564 |
Factorized Graph Representations for Semi-Supervised Learning from Sparse Data |
2020 |
SIGMOD |
4.1905499e-05 |
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.
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 4,760 |
An Efficient Similarity Search Framework for SimRank over Large Dynamic Graphs |
2015 |
VLDB |
5.9342555e-05 |
| 11,020 |
FlowWalker: A Memory-efficient and High-performance GPU-based Dynamic Graph Random Walk Framework |
2024 |
VLDB |
4.1905499e-05 |
| 7,359 |
An I/O-Efficient Disk-based Graph System for Scalable Second-Order Random Walk of Large Graphs |
2022 |
VLDB |
4.7477556e-05 |
| 589 |
Estimating PageRank on Graph Streams |
2008 |
PODS |
0.00019569121 |
| 13,169 |
A Sampling-based Framework for Hypothesis Testing on Large Attributed Graphs |
2024 |
VLDB |
- |
| 4,487 |
On the Embeddability of Random Walk Distances |
2013 |
VLDB |
6.1412716e-05 |
| 5,739 |
Walk, Not Wait: Faster Sampling Over Online Social Networks |
2015 |
VLDB |
5.3454732e-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 |
| 2,102 |
Leveraging History for Faster Sampling of Online Social Networks |
2015 |
VLDB |
9.5379264e-05 |