Finite mixtures of ERGMs for modeling ensembles of networks

DOI10.1214/21-ba1298arXiv1910.11445OpenAlexW3016431077MaRDI QIDQ6121980

Fan Yin, Carter T. Butts, Weining Shen

Publication date: 27 February 2024

Published in: Bayesian Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.11445

zbMATH Keywords

MCMCBayesian mixture modelexponential-family random graph models (ERGMs)adjusted pseudolikelihoodbrain functional connectivity networkspolitical co-voting networks

Mathematics Subject Classification ID

Statistics (62-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Model-based clustering based on sparse finite Gaussian mixtures
• Asymptotic Behaviour of the Posterior Distribution in Overfitted Mixture Models
• On the question of effective sample size in network modeling: an asymptotic inquiry
• Adjusting for network size and composition effects in exponential-family random graph models
• Logit models and logistic regressions for social networks. I: An introduction to Markov graphs and \(p^*\)
• Some simple algorithms for structural comparison
• A toolbox for \(K\)-centroids cluster analysis
• Interpretation and inference in mixture models: simple MCMC works
• Estimating the dimension of a model
• Metric inference for social networks
• Estimation and prediction for stochastic blockmodels for graphs with latent block structure
• Bayesian model averaging: A tutorial. (with comments and a rejoinder).
• Bayesian cluster analysis: point estimation and credible balls (with discussion)
• Using contrastive divergence to seed Monte Carlo MLE for exponential-family random graph models
• On the posterior distribution of the number of components in a finite mixture
• Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
• Comparing clusterings -- an information based distance
• Training Products of Experts by Minimizing Contrastive Divergence
• Model-based clustering for populations of networks
• Bayesian Model Selection for Exponential Random Graph Models via Adjusted Pseudolikelihoods
• A Flexible Parameterization for Baseline Mean Degree in Multiple-Network ERGMs
• Markov Graphs
• An Exponential Family of Probability Distributions for Directed Graphs
• Bayesian Model Selection in Finite Mixtures by Marginal Density Decompositions
• Model-Based Clustering, Discriminant Analysis, and Density Estimation
• Frequentist Model Average Estimators
• A Network‐based Analysis of the 1861 Hagelloch Measles Data
• Bayesian Measures of Model Complexity and Fit
• Markov chain Monte Carlo Estimation of Classical and Dynamic Switching and Mixture Models
• Bayesian Variational Inference for Exponential Random Graph Models
• Local Dependence in Random Graph Models: Characterization, Properties and Statistical Inference
• Model-Based Clustering and Classification for Data Science
• A Stochastic Approximation Method
• Simulating normalizing constants: From importance sampling to bridge sampling to path sampling
• Improved criteria for clustering based on the posterior similarity matrix
• Deviance information criteria for missing data models

This page was built for publication: Finite mixtures of ERGMs for modeling ensembles of networks