Pseudo-likelihood methods for community detection in large sparse networks
From MaRDI portal
(Redirected from Publication:90059)
Abstract: Many algorithms have been proposed for fitting network models with communities, but most of them do not scale well to large networks, and often fail on sparse networks. Here we propose a new fast pseudo-likelihood method for fitting the stochastic block model for networks, as well as a variant that allows for an arbitrary degree distribution by conditioning on degrees. We show that the algorithms perform well under a range of settings, including on very sparse networks, and illustrate on the example of a network of political blogs. We also propose spectral clustering with perturbations, a method of independent interest, which works well on sparse networks where regular spectral clustering fails, and use it to provide an initial value for pseudo-likelihood. We prove that pseudo-likelihood provides consistent estimates of the communities under a mild condition on the starting value, for the case of a block model with two communities.
Recommendations
- A spectral method for community detection in moderately sparse degree-corrected stochastic block models
- Spectral clustering and the high-dimensional stochastic blockmodel
- Consistency of spectral clustering in stochastic block models
- Stochastic blockmodels with a growing number of classes
- Fused community detection
Cites work
- scientific article; zbMATH DE number 3513115 (Why is no real title available?)
- scientific article; zbMATH DE number 3626409 (Why is no real title available?)
- scientific article; zbMATH DE number 2100602 (Why is no real title available?)
- A nonparametric view of network models and Newman–Girvan and other modularities
- An Exponential Family of Probability Distributions for Directed Graphs
- Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
- Classification and estimation in the stochastic blockmodel based on the empirical degrees
- Community structure in social and biological networks
- Consistency of community detection in networks under degree-corrected stochastic block models
- Consistency of maximum-likelihood and variational estimators in the stochastic block model
- Estimation and Prediction for Stochastic Blockstructures
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- Mixed membership stochastic blockmodels
- Mixture models and exploratory analysis in networks
- On the Distribution of the Number of Successes in Independent Trials
- On the convergence properties of the EM algorithm
- On the distribution of the number of successes in independent trials
- Pseudo-likelihood methods for community detection in large sparse networks
- Spectral clustering and the high-dimensional stochastic blockmodel
- Stochastic Blockmodels for Directed Graphs
- The method of moments and degree distributions for network models
- Uncovering latent structure in valued graphs: a variational approach
Cited in
(only showing first 100 items - show all)- Limit theorems for eigenvectors of the normalized Laplacian for random graphs
- Applications of dual regularized Laplacian matrix for community detection
- Fast community detection by SCORE
- Improvements on SCORE, especially for weak signals
- Inferring gene-gene interactions and functional modules using sparse canonical correlation analysis
- Extended stochastic block models with application to criminal networks
- Hierarchical Community Detection by Recursive Partitioning
- Large volatility matrix analysis using global and national factor models
- scientific article; zbMATH DE number 7307464 (Why is no real title available?)
- A fast algorithm for integrative community detection of multi-layer networks
- Efficient split likelihood-based method for community detection of large-scale networks
- Community detection in sparse networks via Grothendieck's inequality
- Estimating a network from multiple noisy realizations
- Analysis of spectral clustering algorithms for community detection: the general bipartite setting
- Community detection with nodal information: likelihood and its variational approximation
- Fallacy of data-selective inference in modelling networks
- Profile-pseudo likelihood methods for community detection of multilayer stochastic block models
- Special invited paper: the SCORE normalization, especially for heterogeneous network and text data
- Model-based clustering of time-evolving networks through temporal exponential-family random graph models
- Using Maximum Entry-Wise Deviation to Test the Goodness of Fit for Stochastic Block Models
- Fused community detection
- Co-citation and Co-authorship Networks of Statisticians
- Comment: Ridge Regression and Regularization of Large Matrices
- Matched bipartite block model with covariates
- Consistent nonparametric estimation for heavy-tailed sparse graphs
- Two-sample test of stochastic block models
- scientific article; zbMATH DE number 7626779 (Why is no real title available?)
- Fast Network Community Detection With Profile-Pseudo Likelihood Methods
- A Time-Varying Network for Cryptocurrencies
- Community detection via an efficient nonconvex optimization approach based on modularity
- Large-scale estimation of random graph models with local dependence
- Optimization via low-rank approximation for community detection in networks
- Network cross-validation for determining the number of communities in network data
- Identifying Community Structures from Network Data via Maximum Likelihood Methods
- Optimal bipartite network clustering
- Corrected Bayesian information criterion for stochastic block models
- Consistent model selection for the degree corrected stochastic blockmodel
- A spectral based goodness-of-fit test for stochastic block models
- A survey on theoretical advances of community detection in networks
- A review on spectral clustering and stochastic block models
- Spectral based hypothesis testing for community detection in complex networks
- Multiresolution Network Models
- A likelihood-ratio type test for stochastic block models with bounded degrees
- A review of dynamic network models with latent variables
- Fusing data depth with complex networks: community detection with prior information
- scientific article; zbMATH DE number 7255095 (Why is no real title available?)
- Testing community structure for hypergraphs
- On semidefinite relaxations for the block model
- Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
- Review on statistical methods for gene network reconstruction using expression data
- Community detection in degree-corrected block models
- Network quantile autoregression
- Consistency of spectral clustering in stochastic block models
- Matrix estimation by universal singular value thresholding
- On the Rényi index of random graphs
- Convexified modularity maximization for degree-corrected stochastic block models
- Covariate regularized community detection in sparse graphs
- Hypothesis testing in sparse weighted stochastic block model
- Detecting overlapping communities in networks using spectral methods
- Additive and multiplicative effects network models
- Posterior contraction rates for stochastic block models
- Estimating mixed-memberships using the symmetric Laplacian inverse matrix
- Efficient discovery of overlapping communities in massive networks
- A practical two-sample test for weighted random graphs
- Smoothing graphons for modelling exchangeable relational data
- Network vector autoregression with individual effects
- The geometry of continuous latent space models for network data
- Community detection by \(L_{0}\)-penalized graph Laplacian
- A semiparametric Bayesian approach to epidemics, with application to the spread of the coronavirus MERS in South Korea in 2015
- Stochastic block models are a discrete surface tension
- Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
- Learning sparse graphons and the generalized Kesten-Stigum threshold
- Impact of regularization on spectral clustering
- Test on stochastic block model: local smoothing and extreme value theory
- Asymptotic uncertainty quantification for communities in sparse planted bi-section models
- Bayesian estimation of the latent dimension and communities in stochastic blockmodels
- An interactive graphical method for community detection in network data
- Nonreconstruction of high-dimensional stochastic block model with bounded degree
- Community detection in complex networks: from statistical foundations to data science applications
- Recent advances on mechanisms of network generation: community, exchangeability, and scale-free properties
- Consistent structure estimation of exponential-family random graph models with block structure
- Profile likelihood biclustering
- Maximum likelihood estimation of sparse networks with missing observations
- Network inference from temporally dependent grouped observations
- Discussion to: ``Bayesian graphical models for modern biological applications by Y. Ni, V. Baladandayuthapani, M. Vannucci and F. C. Stingo
- Consistent Estimation of the Number of Communities via Regularized Network Embedding
- An extension of the angular synchronization problem to the heterogeneous setting
- High-dimensional Gaussian graphical models on network-linked data
- Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing
- Adjacency matrix comparison for stochastic block models
- 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
- Core-periphery structure in networks: a statistical exposition
- A distributed community detection algorithm for large scale networks under stochastic block models
- A multivariate to multivariate approach for voxel-wise genome-wide association analysis
- nett
- randnet
- Testing for association in multiview network data
- The geometry of kernelized spectral clustering
- Online estimation and community detection of network point processes for event streams
This page was built for publication: Pseudo-likelihood methods for community detection in large sparse networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q90059)
