DERGMs: Degeneracy-restricted exponential family random graph models
Authors:
- 31 March 2022
- journal article
- research article
- Published by Cambridge University Press (CUP) in Network Science
- Vol. 10 (1) , 82-110
Abstract
Exponential random graph models, or ERGMs, are a flexible and general class of models for modeling dependent data. While the early literature has shown them to be powerful in capturing many network features of interest, recent work highlights difficulties related to the models’ ill behavior, 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 inference and parameter estimation via the usual Markov chain Monte Carlo algorithms. To address this problem, we propose a new exponential family of models for random graphs that build on the standard ERGM framework. Specifically, we solve the problem of computational intractability and “degenerate” model behavior by an interpretable support restriction. We introduce a new parameter based on the graph-theoretic notion of degeneracy, a measure of sparsity whose value is commonly low in real-world networks. The new model family is supported on the sample space of graphs with bounded degeneracy and is called degeneracy-restricted ERGMs, or DERGMs for short. Since DERGMs generalize ERGMs—the latter is obtained from the former by setting the degeneracy parameter to be maximal—they inherit good theoretical properties, while at the same time place their mass more uniformly over realistic graphs. The support restriction allows the use of new (and fast) Monte Carlo methods for inference, thus making the models scalable and computationally tractable. We study various theoretical properties of DERGMs and illustrate how the support restriction improves the model behavior. We also present a fast Monte Carlo algorithm for parameter estimation that avoids many issues faced by Markov Chain Monte Carlo algorithms used for inference in ERGMs.Keywords
All Related Versions
This publication has 31 references indexed in Scilit:
- Improving Simulation-Based Algorithms for Fitting ERGMsJournal of Computational and Graphical Statistics, 2012
- Exponential-family random graph models for valued networksElectronic Journal of Statistics, 2012
- 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
- A Survey of Statistical Network ModelsFoundations and Trends in Machine Learning, 2010
- On the geometry of discrete exponential families with application to exponential random graph modelsElectronic Journal of Statistics, 2009
- Goodness of Fit of Social Network ModelsJournal of the American Statistical Association, 2008
- Exploring biological network structure using exponential random graph modelsBioinformatics, 2007
- Inference in Curved Exponential Family Models for NetworksJournal of Computational and Graphical Statistics, 2006
- Markov GraphsJournal of the American Statistical Association, 1986