Bayesian estimation of the latent dimension and communities in stochastic blockmodels
From MaRDI portal
Publication:2209705
Abstract: Spectral embedding of adjacency or Laplacian matrices of undirected graphs is a common technique for representing a network in a lower dimensional latent space, with optimal theoretical guarantees. The embedding can be used to estimate the community structure of the network, with strong consistency results in the stochastic blockmodel framework. One of the main practical limitations of standard algorithms for community detection from spectral embeddings is that the number of communities and the latent dimension of the embedding must be specified in advance. In this article, a novel Bayesian model for simultaneous and automatic selection of the appropriate dimension of the latent space and the number of blocks is proposed. Extensions to directed and bipartite graphs are discussed. The model is tested on simulated and real world network data, showing promising performance for recovering latent community structure.
Recommendations
- Latent structure blockmodels for Bayesian spectral graph clustering
- Empirical Bayes estimation for the stochastic blockmodel
- A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
- Bayesian degree-corrected stochastic blockmodels for community detection
- Optimal Bayesian estimation for random dot product graphs
Cites work
- scientific article; zbMATH DE number 1085980 (Why is no real title available?)
- A framework for feature selection in clustering
- A goodness-of-fit test for stochastic block models
- A limit theorem for scaled eigenvectors of random dot product graphs
- A nonparametric view of network models and Newman–Girvan and other modularities
- Automatic dimensionality selection from the scree plot via the use of profile likelihood
- Bayesian Variable Selection in Clustering High-Dimensional Data
- Bayesian analysis of mixture models with an unknown number of components\,--\,an alternative to reversible jump methods.
- Block clustering with collapsed latent block models
- Clustering and community detection in directed networks: a survey
- Co-clustering directed graphs to discover asymmetries and directional communities
- Consistency of maximum-likelihood and variational estimators in the stochastic block model
- Consistency of spectral clustering in stochastic block models
- Estimation and Prediction for Stochastic Blockstructures
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- Hypothesis testing for automated community detection in networks
- Improved criteria for clustering based on the posterior similarity matrix
- Latent Space Approaches to Social Network Analysis
- Latent block model for contingency table
- Limit theorems for eigenvectors of the normalized Laplacian for random graphs
- Markov chain Monte Carlo methods and the label switching problem in Bayesian mixture modeling
- Matrix estimation by universal singular value thresholding
- Mixture models with a prior on the number of components
- Model selection and clustering in stochastic block models based on the exact integrated complete data likelihood
- Network cross-validation for determining the number of communities in network data
- On a two-truths phenomenon in spectral graph clustering
- On the posterior distribution of the number of components in a finite mixture
- Principal component analysis.
- Pseudo-likelihood methods for community detection in large sparse networks
- Random Dot Product Graph Models for Social Networks
- Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
- Scan statistics on Enron graphs
- Spectral clustering and the high-dimensional stochastic blockmodel
- Statistical inference on random dot product graphs: a survey
- Stochastic Blockmodels for Directed Graphs
- The Collapsed Gibbs Sampler in Bayesian Computations with Applications to a Gene Regulation Problem
- Universally consistent vertex classification for latent positions graphs
- Variable Selection for Clustering with Gaussian Mixture Models
- Variable Selection for Model-Based Clustering
Cited in
(16)- Consistent Estimation of the Number of Communities via Regularized Network Embedding
- Bayesian community detection
- Goodness-of-fit test for latent block models
- Community detection in complex networks: from statistical foundations to data science applications
- Bayesian Ridge-Regularized Covariance Selection with Community Behavior in Latent Gaussian Graphical Models
- Estimating the number of communities by spectral methods
- A random effects stochastic block model for joint community detection in multiple networks with applications to neuroimaging
- Latent space approaches to community detection in dynamic networks
- Empirical Bayes estimation for the stochastic blockmodel
- Dynamic stochastic block models: parameter estimation and detection of changes in community structure
- scientific article; zbMATH DE number 7370527 (Why is no real title available?)
- Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clustering
- Spectral Clustering on Spherical Coordinates Under the Degree-Corrected Stochastic Blockmodel
- Optimal Bayesian estimation for random dot product graphs
- Latent structure blockmodels for Bayesian spectral graph clustering
- Bayesian learning of graph substructures
This page was built for publication: Bayesian estimation of the latent dimension and communities in stochastic blockmodels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2209705)
