| dc.contributor.author | Fornshell, Caleb Joseph | |
| dc.description.abstract | 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. | en_US |
| dc.publisher | North Dakota State University | en_US |
| dc.rights | NDSU policy 190.6.2 | en_US |
| dc.title | Empirical Comparison of Statistical Tests of Dense Subgraph in Network Data | en_US |
| dc.type | Thesis | en_US |
| dc.date.accessioned | 2021-05-10T19:15:57Z | |
| dc.date.available | 2021-05-10T19:15:57Z | |
| dc.date.issued | 2020 | |
| dc.identifier.uri | https://hdl.handle.net/10365/31845 | |
| dc.identifier.orcid | 0000-0002-2812-9426 | |
| dc.rights.uri | https://www.ndsu.edu/fileadmin/policy/190.pdf | en_US |
| ndsu.degree | Master of Science (MS) | en_US |
| ndsu.college | Science and Mathematics | en_US |
| ndsu.department | Statistics | en_US |
| ndsu.advisor | Yuan, Mingao | |
