Network Cross-Validation for Determining the Number of Communities in Network Data

DOI10.48550/arXiv.1411.1715zbMath1398.62159arXiv1411.1715OpenAlexW1872749931WikidataQ105583965 ScholiaQ105583965MaRDI QIDQ159626

Jing Lei, Kehui Chen, Kehui Chen, Jing Lei

Publication date: 6 November 2014

Published in: Journal of the American Statistical Association (Search for Journal in Brave)

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

zbMATH Keywords

model selectioncross-validationstochastic block modelsblock-wise node-pair splittingcommunity recovery

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Social networks; opinion dynamics (91D30)

Related Items (36)

Hierarchical Community Detection by Recursive Partitioning ⋮ Asymptotic Theory of Eigenvectors for Random Matrices With Diverging Spikes ⋮ Goodness-of-fit test for latent block models ⋮ Unnamed Item ⋮ Using Maximum Entry-Wise Deviation to Test the Goodness of Fit for Stochastic Block Models ⋮ Community Detection in General Hypergraph Via Graph Embedding ⋮ Optimal Estimation of the Number of Network Communities ⋮ Mixture models and networks: The stochastic blockmodel ⋮ Directed Community Detection With Network Embedding ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Universal rank inference via residual subsampling with application to large networks ⋮ Bias-Adjusted Spectral Clustering in Multi-Layer Stochastic Block Models ⋮ Estimating mixed-memberships using the symmetric Laplacian inverse matrix ⋮ Localization in 1D non-parametric latent space models from pairwise affinities ⋮ Link Prediction for Egocentrically Sampled Networks ⋮ Bayesian estimation of the latent dimension and communities in stochastic blockmodels ⋮ Characterization of topic-based online communities by combining network data and user generated content ⋮ Estimating a network from multiple noisy realizations ⋮ Consistent Estimation of the Number of Communities via Regularized Network Embedding ⋮ Corrected Bayesian Information Criterion for Stochastic Block Models ⋮ Cross-Validation With Confidence ⋮ Computing exact \(p\)-values for community detection ⋮ Maximum likelihood estimation of sparse networks with missing observations ⋮ Estimating the number of communities by spectral methods ⋮ Adjusted chi-square test for degree-corrected block models ⋮ Optimal change point detection and localization in sparse dynamic networks ⋮ Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing ⋮ A statistical framework for modern network science ⋮ Network representation using graph root distributions ⋮ The geometry of continuous latent space models for network data ⋮ randnet ⋮ Node Features Adjusted Stochastic Block Model ⋮ Extended stochastic block models with application to criminal networks ⋮ Unnamed Item ⋮ Detecting Overlapping Communities in Networks Using Spectral Methods

Cites Work

• Unnamed Item
• Pseudo-likelihood methods for community detection in large sparse networks
• Likelihood-based model selection for stochastic block models
• Fast community detection by SCORE
• Rate-optimal graphon estimation
• Bi-cross-validation of the SVD and the nonnegative matrix factorization
• Selecting the number of components in principal component analysis using cross-validation approximations
• Consistency of community detection in networks under degree-corrected stochastic block models
• Matrix estimation by universal singular value thresholding
• Consistency of spectral clustering in stochastic block models
• Improved Bayesian inference for the stochastic block model with application to large networks
• A constant-factor approximation algorithm for the k -median problem (extended abstract)
• A nonparametric view of network models and Newman–Girvan and other modularities
• Spectral redemption in clustering sparse networks
• Exact Recovery in the Stochastic Block Model
• Mixed membership stochastic blockmodels
• Latent Space Approaches to Social Network Analysis
• Dealing With Label Switching in Mixture Models
• A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
• Variational Bayesian inference and complexity control for stochastic block models
• Community detection thresholds and the weak Ramanujan property
• Consistent Adjacency-Spectral Partitioning for the Stochastic Block Model When the Model Parameters Are Unknown
• Random Dot Product Graph Models for Social Networks
• Approximating k-median via pseudo-approximation
• Hypothesis Testing for Automated Community Detection in Networks
• A goodness-of-fit test for stochastic block models

This page was built for publication: Network Cross-Validation for Determining the Number of Communities in Network Data