Back to search

North Dakota State University

Graph two-sample test via empirical likelihood

Abstract

dc:description.abstract

In the past two decades, there has been a notable surge in network data. This proliferation has spurred significant advancements in methods for analyzing networks across various disciplines, including computer science, information sciences, biology, bioinformatics, physics, economics, sociology, and health science. Graph two-sample hypothesis testing, aimed at discerning differences between two populations of networks, arises naturally in diverse scenarios. In this paper, we delve into the essential yet intricate task of testing for equivalence between two networks. There are many testing procedures available. For instance, the t-test based on subgraph counts is one of the methods. In this paper, we propose a new test method by using the empirical likelihood. We run extensive simulations to evaluate the performance of the proposed method and apply it a real-world network. Based on the simulation experiments and real data application, the empirical likelihood test consistently outperforms existing subgraph count tests.

Degree

thesis:*
Grantor dc:publisher
North Dakota State University
Year dc:date.issued
2024

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Zou, Ting

Rights

dc:rights
Statement dc:rights
  • NDSU policy 190.6.2

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/10365/33917

Chain of custody

source
Harvested from
North Dakota State University
Base URL
library.ndsu.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Zou, Ting. Graph two-sample test via empirical likelihood. North Dakota State University, 2024. https://hdl.handle.net/10365/33917