The hierarchy of block models
From MaRDI portal
Abstract: There exist various types of network block models such as the Stochastic Block Model (SBM), the Degree Corrected Block Model (DCBM), and the Popularity Adjusted Block Model (PABM). While this leads to a variety of choices, the block models do not have a nested structure. In addition, there is a substantial jump in the number of parameters from the DCBM to the PABM. The objective of this paper is formulation of a hierarchy of block model which does not rely on arbitrary identifiability conditions. We propose a Nested Block Model (NBM) that treats the SBM, the DCBM and the PABM as its particular cases with specific parameter values, and, in addition, allows a multitude of versions that are more complicated than DCBM but have fewer unknown parameters than the PABM. The latter allows one to carry out clustering and estimation without preliminary testing, to see which block model is really true.
Recommendations
- scientific article; zbMATH DE number 3858845
- Hierarchical models for independence structures of networks
- Modeling the dynamics of social networks using Bayesian hierarchical blockmodels
- Mixture models and networks: The stochastic blockmodel
- Block matrix models for dynamic networks
- Mixed membership stochastic blockmodels
- The highest dimensional stochastic blockmodel with a regularized estimator
- Embedded topics in the stochastic block model
- Semirandom Stochastic Block Models
- A stochastic block model for interaction lengths
Cites work
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 51427 (Why is no real title available?)
- A Block Model for Node Popularity in Networks with Community Structure
- A goodness-of-fit test for stochastic block models
- A nonparametric view of network models and Newman–Girvan and other modularities
- Community detection and stochastic block models
- Community detection in degree-corrected block models
- Consistency of community detection in networks under degree-corrected stochastic block models
- Consistency of spectral clustering in stochastic block models
- Estimation and Clustering in Popularity Adjusted Block Model
- Estimation of Subspace Arrangements with Applications in Modeling and Segmenting Mixed Data
- Mixed membership stochastic blockmodels
- Nearest \(q\)-flat to \(m\) points
- Robust subspace clustering
- Structured matrix estimation and completion
- The average distances in random graphs with given expected degrees
- \(k\)-plane clustering
Cited in
(3)
This page was built for publication: The hierarchy of block models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2121701)