Adjacency matrix comparison for stochastic block models

DOI10.1142/S2010326319500102zbMath1422.60019OpenAlexW2898295633MaRDI QIDQ5197375

Song-Shan Yang, Wang Zhou, Guangren Yang

Publication date: 23 September 2019

Published in: Random Matrices: Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s2010326319500102

zbMATH Keywords

adjacency matrixstochastic block modelsTW distribution

Mathematics Subject Classification ID

Asymptotic properties of nonparametric inference (62G20) Parametric hypothesis testing (62F03) Random matrices (probabilistic aspects) (60B20)

Cites Work

• Pseudo-likelihood methods for community detection in large sparse networks
• Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
• Spectral clustering and the high-dimensional stochastic blockmodel
• Consistency of maximum-likelihood and variational estimators in the stochastic block model
• A nonparametric view of network models and Newman–Girvan and other modularities
• Variational Bayesian inference and complexity control for stochastic block models
• Consistent Adjacency-Spectral Partitioning for the Stochastic Block Model When the Model Parameters Are Unknown
• Hypothesis Testing for Automated Community Detection in Networks
• A goodness-of-fit test for stochastic block models

This page was built for publication: Adjacency matrix comparison for stochastic block models