Bayesian estimation of the latent dimension and communities in stochastic blockmodels
From MaRDI portal
Publication:2209705
DOI10.1007/S11222-020-09946-6zbMATH Open1452.62404arXiv1904.05333OpenAlexW3104299175MaRDI QIDQ2209705FDOQ2209705
Authors: Francesco Sanna Passino, Nicholas A. Heard 
Publication date: 4 November 2020
Published in: Statistics and Computing (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1904.05333
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
community detectionrandom dot product graphspectral embeddingstochastic blockmodelGaussian mixture modelling
Probabilistic graphical models (62H22) Neural nets and related approaches to inference from stochastic processes (62M45)
Cites Work
- A framework for feature selection in clustering
- Latent block model for contingency table
- Principal component analysis.
- A nonparametric view of network models and Newman–Girvan and other modularities
- Variable Selection for Clustering with Gaussian Mixture Models
- Estimation and Prediction for Stochastic Blockstructures
- Model selection and clustering in stochastic block models based on the exact integrated complete data likelihood
- Variable Selection for Model-Based Clustering
- Spectral clustering and the high-dimensional stochastic blockmodel
- Pseudo-likelihood methods for community detection in large sparse networks
- Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
- On the posterior distribution of the number of components in a finite mixture
- Markov chain Monte Carlo methods and the label switching problem in Bayesian mixture modeling
- The Collapsed Gibbs Sampler in Bayesian Computations with Applications to a Gene Regulation Problem
- Title not available (Why is that?)
- Bayesian Variable Selection in Clustering High-Dimensional Data
- Block clustering with collapsed latent block models
- Automatic dimensionality selection from the scree plot via the use of profile likelihood
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- Network Cross-Validation for Determining the Number of Communities in Network Data
- Consistency of maximum-likelihood and variational estimators in the stochastic block model
- Matrix estimation by universal singular value thresholding
- Consistency of spectral clustering in stochastic block models
- Stochastic Blockmodels for Directed Graphs
- Random Dot Product Graph Models for Social Networks
- Hypothesis Testing for Automated Community Detection in Networks
- A goodness-of-fit test for stochastic block models
- Bayesian analysis of mixture models with an unknown number of components\,--\,an alternative to reversible jump methods.
- Latent Space Approaches to Social Network Analysis
- Improved criteria for clustering based on the posterior similarity matrix
- Mixture Models With a Prior on the Number of Components
- A limit theorem for scaled eigenvectors of random dot product graphs
- Universally consistent vertex classification for latent positions graphs
- Scan statistics on Enron graphs
- Clustering and community detection in directed networks: a survey
- Statistical inference on random dot product graphs: a survey
- Co-clustering directed graphs to discover asymmetries and directional communities
- Limit theorems for eigenvectors of the normalized Laplacian for random graphs
- On a two-truths phenomenon in spectral graph clustering
Cited In (14)
- Goodness-of-fit test for latent block models
- Latent structure blockmodels for Bayesian spectral graph clustering
- Bayesian community detection
- Bayesian Ridge-Regularized Covariance Selection with Community Behavior in Latent Gaussian Graphical Models
- Community detection in complex networks: from statistical foundations to data science applications
- Title not available (Why is that?)
- Dynamic stochastic block models: parameter estimation and detection of changes in community structure
- Consistent Estimation of the Number of Communities via Regularized Network Embedding
- Spectral Clustering on Spherical Coordinates Under the Degree-Corrected Stochastic Blockmodel
- A random effects stochastic block model for joint community detection in multiple networks with applications to neuroimaging
- Empirical Bayes estimation for the stochastic blockmodel
- Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clustering
- Latent space approaches to community detection in dynamic networks
- Bayesian learning of graph substructures
Uses Software
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)
