A likelihood-ratio type test for stochastic block models with bounded degrees

From MaRDI portal
Publication:2123258

DOI10.1016/J.JSPI.2021.12.005zbMATH Open1484.62052arXiv1807.04426OpenAlexW2856071244MaRDI QIDQ2123258FDOQ2123258


Authors: Mingao Yuan, Yang Feng, Zuofeng Shang Edit this on Wikidata


Publication date: 8 April 2022

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Abstract: A fundamental problem in network data analysis is to test Erd"{o}s-R'{e}nyi model mathcalGleft(n,fraca+b2night) versus a bisection stochastic block model mathcalGleft(n,fracan,fracbnight), where a,b>0 are constants that represent the expected degrees of the graphs and n denotes the number of nodes. This problem serves as the foundation of many other problems such as testing-based methods for determining the number of communities (cite{BS16,L16}) and community detection (cite{MS16}). Existing work has been focusing on growing-degree regime a,boinfty (cite{BS16,L16,MS16,BM17,B18,GL17a,GL17b}) while leaving the bounded-degree regime untreated. In this paper, we propose a likelihood-ratio (LR) type procedure based on regularization to test stochastic block models with bounded degrees. We derive the limit distributions as power Poisson laws under both null and alternative hypotheses, based on which the limit power of the test is carefully analyzed. We also examine a Monte-Carlo method that partly resolves the computational cost issue. The proposed procedures are examined by both simulated and real-world data. The proof depends on a contiguity theory developed by Janson cite{J95}.


Full work available at URL: https://arxiv.org/abs/1807.04426




Recommendations




Cites Work


Cited In (8)





This page was built for publication: A likelihood-ratio type test for stochastic block models with bounded degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2123258)