Popularity Adjusted Block Models are Generalized Random Dot Product Graphs
From MaRDI portal
Abstract: We connect two random graph models, the Popularity Adjusted Block Model (PABM) and the Generalized Random Dot Product Graph (GRDPG), by demonstrating that the PABM is a special case of the GRDPG in which communities correspond to mutually orthogonal subspaces of latent vectors. This insight allows us to construct new algorithms for community detection and parameter estimation for the PABM, as well as improve an existing algorithm that relies on Sparse Subspace Clustering. Using established asymptotic properties of Adjacency Spectral Embedding for the GRDPG, we derive asymptotic properties of these algorithms. In particular, we demonstrate that the absolute number of community detection errors tends to zero as the number of graph vertices tends to infinity. Simulation experiments illustrate these properties.
Cited in
(7)- A Block Model for Node Popularity in Networks with Community Structure
- Hypothesis testing for equality of latent positions in random graphs
- Aggregate spectral clustering for community detection in multi-layer popularity adjusted block model
- On Inference for Modularity Statistics in Structured Networks
- Node-Level Community Detection within Edge Exchangeable Models for Interaction Processes
- Nonparametric two-sample hypothesis testing for low-rank random graphs of differing sizes
- ACRONYM: Augmented Degree Corrected, Community Reticulated Organized Network Yielding Model
This page was built for publication: Popularity Adjusted Block Models are Generalized Random Dot Product Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6047121)
