A spectral method for community detection in moderately sparse degree-corrected stochastic block models

DOI10.1017/apr.2017.18zbMath1429.91261arXiv1506.08621OpenAlexW2964146010MaRDI QIDQ5233186

Laurent Massoulié, Lennart Gulikers, Marc Lelarge

Publication date: 16 September 2019

Published in: Advances in Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

random graphmachine learningspectral algorithmdegree-corrected stochastic block modelsocial and information network

Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20) Social networks; opinion dynamics (91D30) Applications of graph theory (05C90)

Related Items

An impossibility result for reconstruction in the degree-corrected stochastic block model, Weighted Message Passing and Minimum Energy Flow for Heterogeneous Stochastic Block Models with Side Information, Optimal Bipartite Network Clustering, Rate optimal Chernoff bound and application to community detection in the stochastic block models, Convexified modularity maximization for degree-corrected stochastic block models, Unnamed Item, A Sparse Completely Positive Relaxation of the Modularity Maximization for Community Detection, Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing, Detecting a planted community in an inhomogeneous random graph, Non-Backtracking Spectrum of Degree-Corrected Stochastic Block Models, Testing degree corrections in stochastic block models, Unnamed Item, Unnamed Item, Blind Identification of Stochastic Block Models from Dynamical Observations

Cites Work

• Fast community detection by SCORE
• Consistency thresholds for the planted bisection model
• On the spectra of general random graphs
• Spectral clustering and the high-dimensional stochastic blockmodel
• Consistency of spectral clustering in stochastic block models
• Distributed user profiling via spectral methods
• Spectral redemption in clustering sparse networks
• Exact Recovery in the Stochastic Block Model
• Finding Planted Partitions in Random Graphs with General Degree Distributions
• Matrix Analysis
• Latent Space Approaches to Social Network Analysis
• Community structure in social and biological networks
• The Spectra of Random Graphs with Given Expected Degrees
• Spectral techniques applied to sparse random graphs
• Concentration and regularization of random graphs
• Networks
• Unnamed Item