Hypothesis Testing for Equality of Latent Positions in Random Graphs
arXiv:2105.10838
Abstract
We consider the hypothesis testing problem that two vertices and of a generalized random dot product graph have the same latent positions, possibly up to scaling. Special cases of this hypothesis test include testing whether two vertices in a stochastic block model or degree-corrected stochastic block model graph have the same block membership vectors, or testing whether two vertices in a popularity adjusted block model have the same community assignment. We propose several test statistics based on the empirical Mahalanobis distances between the th and th rows of either the adjacency or the normalized Laplacian spectral embedding of the graph. We show that, under mild conditions, these test statistics have limiting chi-square distributions under both the null and local alternative hypothesis, and we derived explicit expressions for the non-centrality parameters under the local alternative. Using these limit results, we address the model selection problems including choosing between the standard stochastic block model and its degree-corrected variant, and choosing between the ER model and stochastic block model. The effectiveness of our proposed tests are illustrated via both simulation studies and real data applications.
arXiv comment51 pages, 5 figures
References in corpus (10)
- Community structure in social and biological networks
- Point-Set Registration: Coherent Point Drift
- Stochastic blockmodels and community structure in networks
- Consistency of spectral clustering
- Sharp nonasymptotic bounds on the norm of random matrices with independent entries
- Concentration of the adjacency matrix and of the Laplacian in random graphs with independent edges
- Model Selection for Degree-corrected Block Models
- Estimating the number of communities in networks by spectral methods
- Vertex nomination schemes for membership prediction
- Adjusted chi-square test for degree-corrected block models