mlsanityData to 14 Oct 2026

A Sampling-based Framework for Hypothesis Testing on Large Attributed Graphs

arXiv 2403.13286 ↗First posted 20 Mar 2024stat.ML cs.DB cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Hypothesis testing is a statistical method used to draw conclusions about populations from sample data, typically represented in tables. With the prevalence of graph representations in real-life applications, hypothesis testing in graphs is gaining importance. In this work, we formalize node, edge, and path hypotheses in attributed graphs. We develop a sampling-based hypothesis testing framework, which can accommodate existing hypothesis-agnostic graph sampling methods. To achieve accurate and efficient sampling, we then propose a Path-Hypothesis-Aware SamplEr, PHASE, an m- dimensional random walk that accounts for the paths specified in a hypothesis. We further optimize its time efficiency and propose PHASEopt. Experiments on real datasets demonstrate the ability of our framework to leverage common graph sampling methods for hypothesis testing, and the superiority of hypothesis-aware sampling in terms of accuracy and time efficiency.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 37 references that are in the map. First posted on arXiv 20 Mar 2024.

Builds on

6 of 37 references.

References · 6

  1. 2013Hypothesis Testing for Automated Community Detection in Networkscited by 15
  2. 2017Two-sample Hypothesis Testing for Inhomogeneous Random Graphscited by 13
  3. 2019Slim Graph: Practical Lossy Graph Compression for Approximate Graph Processing, Storage, and Analyticscited by 10
  4. 2017Two-Sample Tests for Large Random Graphs Using Network Statisticscited by 7
  5. 2018Practical methods for graph two-sample testingcited by 7
  6. 2015Hypothesis Testing of Matrix Graph Model with Application to Brain Connectivity Analysiscited by 2

Built on by

Not cited yet.