Abstract
AbstractResearchers theorize that many real-world networks exhibit community structure where within-community edges are more likely than between-community edges. While numerous methods exist to cluster nodes into different communities, less work has addressed this question: given some network, does it exhibit statistically meaningful community structure? We answer this question in a principled manner by framing it as a statistical hypothesis test in terms of a general and model-agnostic community structure parameter. Leveraging this parameter, we propose a simple and interpretable test statistic used to formulate two separate hypothesis testing frameworks. The first is an asymptotic test against a baseline value of the parameter while the second tests against a baseline model using bootstrap-based thresholds. We prove theoretical properties of these tests and demonstrate how the proposed method yields rich insights into real-world datasets.
Publisher
Cambridge University Press (CUP)
Reference42 articles.
1. Significance-based community detection in weighted networks;Palowitch;Journal of Machine Learning Research,2018
2. Evolution of cooperation on large networks with community structure;Fotouhi;Journal of the Royal Society Interface,2019
3. Configuring random graph models with fixed degree sequences;Fosdick;Siam Review,2018
4. Toward epidemic thresholds on temporal networks: a review and open questions;Leitch;Applied Network Science,2019
5. Finding community structure in networks using the eigenvectors of matrices;Newman;Physical Review,2006