DERGMs: Degeneracy-restricted exponential random graph models
Authors:
Preprint
Abstract
Exponential random graph models, or ERGMs, are a flexible class of models for networks. Recent work highlights difficulties related to the models' ill behavior, dubbed `degeneracy', such as most of the probability mass being concentrated on a very small subset of the parameter space. This behavior limits both the applicability of an ERGM as a model for real data and parameter estimation via the usual MCMC algorithms. To address this problem, we propose a new exponential family of models for random graphs that build on the standard ERGM framework. We resolve the degenerate model behavior by an interpretable support restriction. Namely, we introduce a new parameter based on the graph-theoretic notion of degeneracy, a measure of sparsity whose value is low in real-worlds networks. We prove this support restriction does not eliminate too many graphs from the support of an ERGM, and we also prove that degeneracy of a model is captured precisely by stability of its sufficient statistics. We show examples of ERGMs that are degenerate whose counterpart DERGMs are not, both theoretically and by simulations, and we test our model class on a set of real world networks.Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Stable exponential random graph models with non-parametric components for large dense networksSocial Networks, 2017
- Reducing Degeneracy in Maximum Entropy Models of NetworksPhysical Review Letters, 2015
- Estimating and understanding exponential random graph modelsThe Annals of Statistics, 2013
- Instability, Sensitivity, and Degeneracy of Discrete Exponential FamiliesJournal of the American Statistical Association, 2011
- Adjusting for network size and composition effects in exponential-family random graph modelsStatistical Methodology, 2011
- Bayesian inference for exponential random graph modelsSocial Networks, 2011
- On the geometry of discrete exponential families with application to exponential random graph modelsElectronic Journal of Statistics, 2009
- Exploring biological network structure using exponential random graph modelsBioinformatics, 2007
- Constrained Monte Carlo Maximum Likelihood for Dependent DataJournal of the Royal Statistical Society Series B: Statistical Methodology, 1992
- Network structure and minimum degreeSocial Networks, 1983