Pith. sign in

REVIEW 2 cited by

Nested stochastic block model for simultaneously clustering networks and nodes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2307.09210 v2 pith:TS2SENBI submitted 2023-07-18 stat.ME cs.SIstat.ML

classification stat.MEcs.SIstat.ML
keywords modelnetworknetworksclusteringcommunitiesgibbsnestednodes
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Hierarchical Clustering of Networks via Hierarchical Distance Matrices

    stat.ME 2026-07 conditional novelty 7.0 of 10

    A provably consistent top-down procedure that recovers latent hierarchical clusters of networks from hierarchical distance matrices.

  2. A Latent Position Co-Clustering Model for Multiplex Networks

    stat.ME 2025-07 conditional novelty 6.0 of 10

    LaPCoM is a Bayesian nonparametric mixture-of-mixtures latent position model that jointly clusters networks and nodes in multiplex data.

Pith tools