Nonparametric Bayes Modeling of Populations of Networks
Not on the map. Why?
Abstract (arXiv)
Replicated network data are increasingly available in many research fields. In connectomic applications, inter-connections among brain regions are collected for each patient under study, motivating statistical models which can flexibly characterize the probabilistic generative mechanism underlying these network-valued data. Available models for a single network are not designed specifically for inference on the entire probability mass function of a network-valued random variable and therefore lack flexibility in characterizing the distribution of relevant topological structures. We propose a flexible Bayesian nonparametric approach for modeling the population distribution of network-valued data. The joint distribution of the edges is defined via a mixture model which reduces dimensionality and efficiently incorporates network information within each mixture component by leveraging latent space representations. The formulation leads to an efficient Gibbs sampler and provides simple and coherent strategies for inference and goodness-of-fit assessments. We provide theoretical results on the flexibility of our model and illustrate improved performance --- compared to state-of-the-art models --- in simulations and application to human brain networks.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 30 Jun 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 5; 2023: 0; 2024: 0; 2025: 2.
11 papers.
- 2021Continuous Latent Position Models for Instantaneous Interactionscited by 8
- 2022Multiscale Graph Comparison via the Embedded Laplacian Discrepancycited by 5
- 2022Lost in the Shuffle: Testing Power in the Presence of Errorful Network Vertex Labelscited by 3
- 2025Graph Counterfactual Explainable AI via Latent Space Traversalcited by 3
- 2022Structured Optimal Variational Inference for Dynamic Latent Space Modelscited by 2
- 2021On the Number of Edges of the Frechet Mean and Median Graphscited by 1
- 2021Network Clustering for Latent State and Changepoint Detectioncited by 1
- 2021Differentially Describing Groups of Graphscited by 1
- 2022Multivariate Analysis for Multiple Network Data via Semi-Symmetric Tensor PCAcited by 1
- 2022Outlier Detection for Multi-Network Datacited by 0
- 2025Barycentric subspace analysis of network-valued datacited by 0
- 2025Barycentric subspace analysis of network-valued data31 Jul 2025
- 2025Graph Counterfactual Explainable AI via Latent Space Traversal15 Jan 2025
- 2022Structured Optimal Variational Inference for Dynamic Latent Space Models29 Sep 2022
- 2022Lost in the Shuffle: Testing Power in the Presence of Errorful Network Vertex Labels18 Aug 2022
- 2022Outlier Detection for Multi-Network Data12 May 2022
- 2022Multivariate Analysis for Multiple Network Data via Semi-Symmetric Tensor PCA9 Feb 2022
- 2022Multiscale Graph Comparison via the Embedded Laplacian Discrepancy28 Jan 2022
- 2021Differentially Describing Groups of Graphs16 Dec 2021
- 2021Network Clustering for Latent State and Changepoint Detection1 Nov 2021
- 2021On the Number of Edges of the Frechet Mean and Median Graphs30 May 2021
- 2021Continuous Latent Position Models for Instantaneous Interactions31 Mar 2021