Date of Award
2020
Publisher
North Dakota State University
Document Type
Thesis
Degree Awarded
Master of Science (MS)
Department
Statistics
College
Science and Mathematics
Faculty Advisor
Yuan, Mingao
Description
Network 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.
Recommended Citation
Fornshell, Caleb Joseph, "Empirical Comparison of Statistical Tests of Dense Subgraph in Network Data" (2020). Statistics. 93.
https://digitalcommons.ndsu.edu/stats/93
Rights
NDSU policy 190.6.2
Rights Link
https://www.ndsu.edu/fileadmin/policy/190.pdf
Author ORCID Identifier
0000-0002-2812-9426
Handle Identifier
https://hdl.handle.net/10365/31845