pith. sign in

arxiv: 2307.09210 · v2 · pith:TS2SENBInew · submitted 2023-07-18 · 📊 stat.ME · cs.SI· stat.ML

Nested stochastic block model for simultaneously clustering networks and nodes

classification 📊 stat.ME cs.SIstat.ML
keywords modelnetworknetworksclusteringcommunitiesgibbsnestednodes
0
0 comments X
read the original abstract

We introduce the nested stochastic block model (NSBM) to cluster a collection of networks while simultaneously detecting communities within each network. NSBM has several appealing features including the ability to work on unlabeled networks with potentially different node sets, the flexibility to model heterogeneous communities, and the means to automatically select the number of classes for the networks and the number of communities within each network. This is accomplished via a Bayesian model, with a novel application of the nested Dirichlet process (NDP) as a prior to jointly model the between-network and within-network clusters. The dependency introduced by the network data creates nontrivial challenges for the NDP, especially in the development of efficient samplers. For posterior inference, we propose several Markov chain Monte Carlo algorithms including a standard Gibbs sampler, a collapsed Gibbs sampler, and two blocked Gibbs samplers that ultimately return two levels of clustering labels from both within and across the networks. Extensive simulation studies are carried out which demonstrate that the model provides very accurate estimates of both levels of the clustering structure. We also apply our model to two social network datasets that cannot be analyzed using any previous method in the literature due to the anonymity of the nodes and the varying number of nodes in each network.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A Bayesian Adaptive Latent Mixture Model for Zero-Inflated Weighted Brain Connectome Analysis

    stat.ME 2026-05 unverdicted novelty 7.0

    A Bayesian adaptive latent mixture model using simplex mixtures of low-rank latent score matrices and hurdle likelihoods for zero-inflated weighted brain connectomes, with posterior consistency and predictive consiste...