Exponential-Family Models of Random Graphs: Inference in Finite, Super and Infinite Population Scenarios
Michael Schweinberger, Pavel N. Krivitsky, Carter T. Butts, Jonathan R. Stewart
Abstract
Exponential-family Random Graph Models (ERGMs) constitute a large statistical framework for modeling dense and sparse random graphs with short- or long-tailed degree distributions, covariate effects and a wide range of complex dependencies. Special cases of ERGMs include network equivalents of generalized linear models (GLMs), Bernoulli random graphs, $\beta $-models, $p_{1}$-models and models related to Markov random fields in spatial statistics and image processing. While ERGMs are widely used in practice, questions have been raised about their theoretical properties. These include concerns that some ERGMs are near-degenerate and that many ERGMs are non-projective. To address such questions, careful attention must be paid to model specifications and their underlying assumptions, and to the inferential settings in which models are employed. As we discuss, near-degeneracy can affect simplistic ERGMs lacking structure, but well-posed ERGMs with additional structure can be well-behaved. Likewise, lack of projectivity can affect non-likelihood-based inference, but likelihood-based inference does not require projectivity. Here, we review well-posed ERGMs along with likelihood-based inference. We first clarify the core statistical notions of “sample” and “population” in the ERGM framework, separating the process that generates the population graph from the observation process. We then review likelihood-based inference in finite, super and infinite population scenarios. We conclude with consistency results, and an application to human brain networks.