North Dakota State University
Empirical Comparison of Statistical Tests of Dense Subgraph in Network Data
Abstract
dc:description.abstractNetwork analysis is useful in modeling the structures of different phenomena. A fundamental question in the analysis of network data is whether a network contains community structure. One type of community structure of interest is a dense subgraph. Statistically deciding whether a network contains a dense subgraph can be formulated as a hypothesis test where under the null hypothesis, there is no community structure, and under the alternative hypothesis, the network contains a dense subgraph. One method in performing this hypothesis test is by counting the frequency of shapes created by all three-node subgraphs. In this study, three different test statistics based on the frequency of three-node subgraph shapes will be compared in their ability to detect a dense subgraph in simulated networks of varying size and characteristics.
Degree
thesis:*- Grantor dc:publisher
- North Dakota State University
- Year dc:date.issued
- 2020
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Fornshell, Caleb Joseph
- ORCID dc:identifier.orcid
Rights
dc:rights- Statement dc:rights
-
- NDSU policy 190.6.2
- Licence dc:rights.uri
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- https://hdl.handle.net/10365/31845