Optimal adaptivity of signed-polygon statistics for network testing

DOI10.1214/21-AOS2089zbMath1486.62168arXiv1904.09532OpenAlexW2937019359MaRDI QIDQ2073714

Zheng Tracy Ke, Jiashun Jin, Shengming Luo

Publication date: 7 February 2022

Published in: The Annals of Statistics (Search for Journal in Brave)

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

zbMATH Keywords

asymptotic normalityphase transitionlower boundsparsitymatrix scalingoptimal phase diagramsigned quadrilateralsigned triangleSinkhorn's theorem

Mathematics Subject Classification ID

Hypothesis testing in multivariate analysis (62H15) Clustering in the social and behavioral sciences (91C20) Social networks; opinion dynamics (91D30) Applications of statistics to social sciences (62P25)

Related Items

Hierarchical Community Detection by Recursive Partitioning, Mathematical foundations of machine learning. Abstracts from the workshop held March 21--27, 2021 (hybrid meeting), On the efficacy of higher-order spectral clustering under weighted stochastic block models, Optimal Estimation of the Number of Network Communities, Power enhancement and phase transitions for global testing of the mixed membership stochastic block model, Universal rank inference via residual subsampling with application to large networks, A Spectral-Based Framework for Hypothesis Testing in Populations of Networks, Stock co-jump networks, Random geometric graph: some recent developments and perspectives, Mixed Membership Estimation for Social Networks

Cites Work

• Unnamed Item
• Likelihood-based model selection for stochastic block models
• Fast community detection by SCORE
• Reconstruction and estimation in the planted partition model
• The method of moments and degree distributions for network models
• Subsampling bootstrap of count features of networks
• An impossibility result for reconstruction in the degree-corrected stochastic block model
• Contiguity and non-reconstruction results for planted partition models: the dense case
• Higher criticism for detecting sparse heterogeneous mixtures.
• Detection boundary in sparse regression
• Matrix estimation by universal singular value thresholding
• Computational barriers in minimax submatrix detection
• Scaling of matrices to achieve specified row and column sums
• Testing for high-dimensional geometry in random graphs
• Mixed membership stochastic blockmodels
• Scaling of symmetric matrices by positive diagonal congruence
• Diagonal Equivalence to Matrices with Prescribed Row and Column Sums. II
• The DAD Theorem for Arbitrary Row Sums
• Community structure in social and biological networks
• Non-Backtracking Spectrum of Degree-Corrected Stochastic Block Models
• Detecting Overlapping Communities in Networks Using Spectral Methods
• Hypothesis Testing for Automated Community Detection in Networks
• Hierarchical Community Detection by Recursive Partitioning
• A goodness-of-fit test for stochastic block models