1. Testing for Equivalence of Network Distribution Using Subgraph Counts
- Author
-
Carey E. Priebe, Sofia C. Olhede, P.-A. G. Maugis, and Patrick J. Wolfe
- Subjects
Statistics and Probability ,brain connectivity ,05 social sciences ,blockmodel ,connectomes ,subgraph count statistics ,01 natural sciences ,010104 statistics & probability ,statistical testing ,0502 economics and business ,Statistics ,Discrete Mathematics and Combinatorics ,0101 mathematics ,Statistics, Probability and Uncertainty ,Equivalence (measure theory) ,050205 econometrics ,Statistical hypothesis testing ,Mathematics - Abstract
We consider that a network is an observation, and a collection of observed networks forms a sample. In this setting, we provide methods to test whether all observations in a network sample are drawn from a specified model. We achieve this by deriving the joint asymptotic properties of average subgraph counts as the number of observed networks increases but the number of nodes in each network remains finite. In doing so, we do not require that each observed network contains the same number of nodes, or is drawn from the same distribution. Our results yield joint confidence regions for subgraph counts, and therefore methods for testing whether the observations in a network sample are drawn from: a specified distribution, a specified model, or from the same model as another network sample. We present simulation experiments and an illustrative example on a sample of brain networks where we find that highly creative individuals' brains present significantly more short cycles than found in less creative people. for this article are available online.
- Published
- 2020
- Full Text
- View/download PDF