pith. sign in

arxiv: 2503.11990 · v2 · pith:G2FS6WDJnew · submitted 2025-03-15 · 📊 stat.ME

A Goodness-of-Fit Test for Sparse Networks

classification 📊 stat.ME
keywords testnetworksproposedsparsegoodness-of-fitmodelnetworkstatistic
0
0 comments X
read the original abstract

The stochastic block model (SBM) has been widely used to analyze network data. Various goodness-of-fit tests have been proposed to assess the adequacy of model structures. To the best of our knowledge, however, none of the existing approaches are applicable for sparse networks in which the connection probability of any two communities is of order log(n)/n, and the number of communities is divergent. To fill this gap, we propose a novel goodness-of-fit test for the stochastic block model. The key idea is to construct statistics by sampling the maximum entry-deviations of the adjacency matrix that the negative impacts of network sparsity are alleviated by the sampling process. We demonstrate theoretically that the proposed test statistic converges to the Type-I extreme value distribution under the null hypothesis regardless of the network structure. Accordingly, it can be applied to both dense and sparse networks. In addition, we obtain the asymptotic power against alternatives. Moreover, we introduce a bootstrap-corrected test statistic to improve the finite sample performance, recommend an augmented test statistic to increase the power, and extend the proposed test to the degree-corrected SBM. Simulation studies and two empirical examples with both dense and sparse networks indicate that the proposed method performs well.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. From Simple to Composite Perturbations: A Unified Decomposition Framework for Stochastic Block Models

    stat.ME 2026-04 unverdicted novelty 7.0

    A decomposition framework for simple and composite perturbations in normalized adjacency matrices improves the allowable number of communities to K=o(n^{1/6}) for largest-eigenvalue tests and completes the asymptotic ...