A Sampling-based Framework for Hypothesis Testing on Large Attributed Graphs
Summary: Formalizes node, edge, and path hypotheses on attributed graphs and presents a sampling-based hypothesis-testing framework that leverages existing graph samplers. Introduces PHASE, an m-dimensional path-hypothesis-aware random walk (and optimized PHASEopt) to improve sampling accuracy and runtime, with experiments showing superiority over hypothesis-agnostic methods. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yun Wang
- 2. Chrysanthi Kosyfaki
- 3. Sihem Amer-Yahia
- 4. Reynold Cheng
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,614 | Auto-Approximation of Graph Computing | 2014 | VLDB | 4.3136057e-05 |
| 5,141 | A Random Walk Approach to Sampling Hidden Databases | 2007 | SIGMOD | 5.6627467e-05 |
| 4,760 | An Efficient Similarity Search Framework for SimRank over Large Dynamic Graphs | 2015 | VLDB | 5.9342555e-05 |
| 6,705 | Combining Sampling and Synopses with Worst-Case Optimal Runtime and Quality Guarantees for Graph Pattern Cardinality Estimation | 2021 | SIGMOD | 4.9507418e-05 |
| 5,739 | Walk, Not Wait: Faster Sampling Over Online Social Networks | 2015 | VLDB | 5.3454732e-05 |
| 5,447 | Output Space Sampling for Graph Patterns | 2009 | VLDB | 5.498563e-05 |
| 2,102 | Leveraging History for Faster Sampling of Online Social Networks | 2015 | VLDB | 9.5379264e-05 |
| 4,903 | On Sampling from Massive Graph Streams | 2017 | VLDB | 5.8403259e-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 |