mlsanityData to 7 Oct 2026

Latent structure blockmodels for Bayesian spectral graph clustering

arXiv 2107.01734 ↗First posted 4 Jul 2021stat.ML cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Spectral embedding of network adjacency matrices often produces node representations living approximately around low-dimensional submanifold structures. In particular, hidden substructure is expected to arise when the graph is generated from a latent position model. Furthermore, the presence of communities within the network might generate community-specific submanifold structures in the embedding, but this is not explicitly accounted for in most statistical models for networks. In this article, a class of models called latent structure block models (LSBM) is proposed to address such scenarios, allowing for graph clustering when community-specific one dimensional manifold structure is present. LSBMs focus on a specific class of latent space model, the random dot product graph (RDPG), and assign a latent submanifold to the latent positions of each community. A Bayesian model for the embeddings arising from LSBMs is discussed, and shown to have a good performance on simulated and real world network data. The model is able to correctly recover the underlying communities living in a one-dimensional manifold, even when the parametric form of the underlying curves is unknown, achieving remarkable results on a variety of real data.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 19 of its 64 references that are in the map. First posted on arXiv 4 Jul 2021.

Builds on

19 of 64 references.

References · 19

  1. 2017Statistical inference on random dot product graphs: a surveycited by 70
  2. 2017A statistical interpretation of spectral embedding: the generalised random dot product graphcited by 55
  3. 2013Regularized Spectral Clustering under the Degree-Corrected Stochastic Blockmodelcited by 45
  4. 2018On a 'Two Truths' Phenomenon in Spectral Graph Clusteringcited by 24
  5. 2013Perfect Clustering for Stochastic Blockmodel Graphs via Adjacency Spectral Embeddingcited by 23
  6. 2017Variational Inference for Gaussian Process Models with Linear Complexitycited by 21
  7. 2020The multilayer random dot product graphcited by 18
  8. 2020Manifold structure in graph embeddingscited by 17
  9. 2017Spectral clustering in the dynamic stochastic block modelcited by 12
  10. 2017The Geometry of Continuous Latent Space Models for Network Datacited by 11
  11. 2018On estimation and inference in latent structure random graphscited by 9
  12. 2020Spectral clustering on spherical coordinates under the degree-corrected stochastic blockmodelcited by 9
7 more
  1. 2016Exchangeable Random Measures for Sparse and Modular Graphs with Overlapping Communitiescited by 8
  2. 2020Learning 1-Dimensional Submanifolds for Subsequent Inference on Random Dot Product Graphscited by 6
  3. 2021Spectral clustering under degree heterogeneity: a case for the random walk Laplaciancited by 6
  4. 2017Semiparametric spectral modeling of the Drosophila connectomecited by 5
  5. 2019Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clusteringcited by 4
  6. 2019Bayesian estimation of the latent dimension and communities in stochastic blockmodelscited by 4
  7. 2017Improving Spectral Clustering using the Asymptotic Value of the Normalised Cutcited by 3

Built on by

Not cited yet.