Pith. sign in

REVIEW 1 cited by

Stochastic blockmodels for exchangeable collections of networks

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 1606.05277 v1 pith:AQO5VMZN submitted 2016-06-16 stat.ME

classification stat.ME
keywords networksblockmodelsstochasticunderlyingalgorithmsallocatedallowingallows
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We construct a novel class of stochastic blockmodels using Bayesian nonparametric mixtures. These model allows us to jointly estimate the structure of multiple networks and explicitly compare the community structures underlying them, while allowing us to capture realistic properties of the underlying networks. Inference is carried out using MCMC algorithms that incorporates sequentially allocated split-merge steps to improve mixing. The models are illustrated using a simulation study and a variety of real-life examples.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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.

Pith tools