Testing for Global Network Structure Using Small Subgraph Statistics

10/02/2017
by   Chao Gao, et al.
0

We study the problem of testing for community structure in networks using relations between the observed frequencies of small subgraphs. We propose a simple test for the existence of communities based only on the frequencies of three-node subgraphs. The test statistic is shown to be asymptotically normal under a null assumption of no community structure, and to have power approaching one under a composite alternative hypothesis of a degree-corrected stochastic block model. We also derive a version of the test that applies to multivariate Gaussian data. Our approach achieves near-optimal detection rates for the presence of community structure, in regimes where the signal-to-noise is too weak to explicitly estimate the communities themselves, using existing computationally efficient algorithms. We demonstrate how the method can be effective for detecting structure in social networks, citation networks for scientific articles, and correlations of stock returns between companies on the S&P 500.

READ FULL TEXT
research
12/10/2014

Detecting Overlapping Communities in Networks Using Spectral Methods

Community detection is a fundamental problem in network analysis which i...
research
03/09/2023

Phase transition for detecting a small community in a large network

How to detect a small community in a large network is an interesting pro...
research
09/07/2019

Community detection in inhomogeneous random graphs

We study the problem of detecting whether an inhomogeneous random graph ...
research
04/23/2022

Power Enhancement and Phase Transitions for Global Testing of the Mixed Membership Stochastic Block Model

The mixed-membership stochastic block model (MMSBM) is a common model fo...
research
12/30/2020

Adjusted chi-square test for degree-corrected block models

We propose a goodness-of-fit test for degree-corrected stochastic block ...
research
07/26/2023

Empirical likelihood test for community structure in networks

Network data, characterized by interconnected nodes and edges, is pervas...
research
01/19/2022

Multiway Spherical Clustering via Degree-Corrected Tensor Block Models

We consider the problem of multiway clustering in the presence of unknow...

Please sign up or login with your details

Forgot password? Click here to reset