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

Yun Wang, Chrysanthi Kosyfaki, Sihem Amer-Yahia, Reynold Cheng
3/20/2024
stat.MLcs.DBcs.LG

No official code found. Best implementation: Carrieww/GraphHT (2 stars, MIT, last commit 2026-01-07).

Abstract

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.

View on arXivView PDF

Code Implementations(1)

Carrieww/GraphHTCommunity100%
MIT
20Shell, PythonJul 3, 20239 months agoMIT

Similar Papers

Cite this paper

@article{wang2024samplingbased,
  title  = {A Sampling-based Framework for Hypothesis Testing on Large Attributed Graphs},
  author = {Yun Wang and Chrysanthi Kosyfaki and Sihem Amer-Yahia and Reynold Cheng},
  year   = {2024},
  eprint = {2403.13286},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2403.13286v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2403.13286.svg)](https://codeofpaper.com/paper/2403.13286)

Discussion