Finite Mixtures of ERGMs for Ensembles of Networks

by   Fan Yin, et al.

Ensembles of networks arise in many scientific fields, but currently there are few statistical models aimed at understanding their generative processes. To fill in this gap, we propose characterizing network ensembles via finite mixtures of exponential family random graph models, employing a Metropolis-within-Gibbs algorithm to conduct Bayesian inference. Simulation studies show that the proposed procedure can recover the true cluster assignments and cluster-specific parameters. We demonstrate the utility of the proposed approach using an ensemble of political co-voting networks among U.S. Senators.


Bayesian Nonparametric Mixtures of Exponential Random Graph Models for Ensembles of Networks

Ensembles of networks arise in various fields where multiple independent...

Amortized Bayesian inference for clustering models

We develop methods for efficient amortized approximate Bayesian inferenc...

Bayesian Inference with Anchored Ensembles of Neural Networks, and Application to Reinforcement Learning

The use of ensembles of neural networks (NNs) for the quantification of ...

Uncertainty Visualization of 2D Morse Complex Ensembles Using Statistical Summary Maps

Morse complexes are gradient-based topological descriptors with close co...

Fast sampling from β-ensembles

We study sampling algorithms for β-ensembles with time complexity less t...

Stochastic Tree Ensembles for Estimating Heterogeneous Effects

Determining subgroups that respond especially well (or poorly) to specif...

Please sign up or login with your details

Forgot password? Click here to reset