Pseudo-likelihood methods for community detection in large sparse networks

DOI10.1214/13-AOS1138zbMath1277.62166arXiv1207.2340OpenAlexW3101919829WikidataQ105584325 ScholiaQ105584325MaRDI QIDQ90059

Arash A. Amini, Peter J. Bickel, Aiyou Chen, Elizaveta Levina, Arash A. Amini, Aiyou Chen, Peter J. Bickel

Publication date: 1 August 2013

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

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

zbMATH Keywords

networkspseudo-likelihoodcommunity detection

Mathematics Subject Classification ID

Multivariate analysis (62H99) Asymptotic properties of nonparametric inference (62G20) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Nonparametric estimation (62G05)

Related Items (93)

Testing community structure for hypergraphs ⋮ An interactive graphical method for community detection in network data ⋮ A likelihood-ratio type test for stochastic block models with bounded degrees ⋮ Hierarchical Community Detection by Recursive Partitioning ⋮ Community Detection in Sparse Networks Using the Symmetrized Laplacian Inverse Matrix (SLIM) ⋮ Smoothing graphons for modelling exchangeable relational data ⋮ Network inference from temporally dependent grouped observations ⋮ Community detection via an efficient nonconvex optimization approach based on modularity ⋮ Large-scale estimation of random graph models with local dependence ⋮ A review on spectral clustering and stochastic block models ⋮ Optimal Bipartite Network Clustering ⋮ Impact of regularization on spectral clustering ⋮ Community detection by \(L_{0}\)-penalized graph Laplacian ⋮ An extension of the angular synchronization problem to the heterogeneous setting ⋮ Discussion to: \textit{Bayesian graphical models for modern biological applications} by Y. Ni, V. Baladandayuthapani, M. Vannucci and F.C. Stingo ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Hypothesis testing in sparse weighted stochastic block model ⋮ A review of dynamic network models with latent variables ⋮ Rate optimal Chernoff bound and application to community detection in the stochastic block models ⋮ Convexified modularity maximization for degree-corrected stochastic block models ⋮ Test on stochastic block model: local smoothing and extreme value theory ⋮ Using Maximum Entry-Wise Deviation to Test the Goodness of Fit for Stochastic Block Models ⋮ A semiparametric Bayesian approach to epidemics, with application to the spread of the coronavirus MERS in South Korea in 2015 ⋮ Testing for association in multiview network data ⋮ A distributed community detection algorithm for large scale networks under stochastic block models ⋮ Large volatility matrix analysis using global and national factor models ⋮ Fast Network Community Detection With Profile-Pseudo Likelihood Methods ⋮ Unnamed Item ⋮ A practical two-sample test for weighted random graphs ⋮ Estimating mixed-memberships using the symmetric Laplacian inverse matrix ⋮ Asymptotic uncertainty quantification for communities in sparse planted bi-section models ⋮ Learning sparse graphons and the generalized Kesten-Stigum threshold ⋮ Spectral Clustering via Adaptive Layer Aggregation for Multi-Layer Networks ⋮ Discussion of “A Tale of Two Datasets: Representativeness and Generalisability of Inference for Samples of Networks” by Pavel N. Krivitsky, Pietro Coletti, and Niel Hens ⋮ Online estimation and community detection of network point processes for event streams ⋮ Core-periphery structure in networks: a statistical exposition ⋮ Posterior contraction rates for stochastic block models ⋮ Bayesian estimation of the latent dimension and communities in stochastic blockmodels ⋮ Estimating a network from multiple noisy realizations ⋮ Consistent Estimation of the Number of Communities via Regularized Network Embedding ⋮ Exponential-family models of random graphs: inference in finite, super and infinite population scenarios ⋮ A testing based extraction algorithm for identifying significant communities in networks ⋮ Network vector autoregression with individual effects ⋮ Corrected Bayesian Information Criterion for Stochastic Block Models ⋮ A divisive spectral method for network community detection ⋮ Maximum likelihood estimation of sparse networks with missing observations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On semidefinite relaxations for the block model ⋮ Model-based clustering of multiple networks with a hierarchical algorithm ⋮ Submatrix localization via message passing ⋮ Spectral based hypothesis testing for community detection in complex networks ⋮ Fusing data depth with complex networks: community detection with prior information ⋮ Efficient discovery of overlapping communities in massive networks ⋮ Review on statistical methods for gene network reconstruction using expression data ⋮ Pseudo-likelihood methods for community detection in large sparse networks ⋮ Estimating the number of communities by spectral methods ⋮ nett ⋮ Stochastic block models are a discrete surface tension ⋮ Adjacency matrix comparison for stochastic block models ⋮ Optimization via low-rank approximation for community detection in networks ⋮ Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing ⋮ Additive and multiplicative effects network models ⋮ Nonreconstruction of high-dimensional stochastic block model with bounded degree ⋮ Community detection in sparse networks via Grothendieck's inequality ⋮ The geometry of continuous latent space models for network data ⋮ Community detection in degree-corrected block models ⋮ Limit theorems for eigenvectors of the normalized Laplacian for random graphs ⋮ Fast community detection by SCORE ⋮ Model-based clustering of time-evolving networks through temporal exponential-family random graph models ⋮ Profile likelihood biclustering ⋮ Consistent structure estimation of exponential-family random graph models with block structure ⋮ Network Cross-Validation for Determining the Number of Communities in Network Data ⋮ Rate-optimal graphon estimation ⋮ randnet ⋮ Consistent nonparametric estimation for heavy-tailed sparse graphs ⋮ Multiresolution Network Models ⋮ Likelihood Inference for Large Scale Stochastic Blockmodels With Covariates Based on a Divide-and-Conquer Parallelizable Algorithm With Communication ⋮ Probabilistic Community Detection With Unknown Number of Communities ⋮ Analysis of spectral clustering algorithms for community detection: the general bipartite setting ⋮ Network quantile autoregression ⋮ Extended stochastic block models with application to criminal networks ⋮ Covariate Regularized Community Detection in Sparse Graphs ⋮ Unnamed Item ⋮ Matrix estimation by universal singular value thresholding ⋮ Consistency of spectral clustering in stochastic block models ⋮ Unnamed Item ⋮ The geometry of kernelized spectral clustering ⋮ Inferring gene-gene interactions and functional modules using sparse canonical correlation analysis ⋮ Role of normalization in spectral clustering for stochastic blockmodels ⋮ Robust and computationally feasible community detection in the presence of arbitrary outlier nodes ⋮ Detecting Overlapping Communities in Networks Using Spectral Methods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• The method of moments and degree distributions for network models
• Uncovering latent structure in valued graphs: a variational approach
• On the convergence properties of the EM algorithm
• On the distribution of the number of successes in independent trials
• Estimation and prediction for stochastic blockmodels for graphs with latent block structure
• Consistency of community detection in networks under degree-corrected stochastic block models
• Consistency of maximum-likelihood and variational estimators in the stochastic block model
• Classification and estimation in the stochastic blockmodel based on the empirical degrees
• A nonparametric view of network models and Newman–Girvan and other modularities
• Mixed membership stochastic blockmodels
• On the Distribution of the Number of Successes in Independent Trials
• Mixture models and exploratory analysis in networks
• An Exponential Family of Probability Distributions for Directed Graphs
• Estimation and Prediction for Stochastic Blockstructures
• Community structure in social and biological networks
• Stochastic Blockmodels for Directed Graphs

This page was built for publication: Pseudo-likelihood methods for community detection in large sparse networks