Exponential-Family Models of Random Graphs: Inference in Finite-, Super-, and Infinite Population Scenarios
Michael Schweinberger, Pavel N. Krivitsky, Carter T. Butts, Jonathan, Stewart

TL;DR
This paper reviews the statistical properties and inference methods of exponential-family random graph models (ERGMs), addressing issues like near-degeneracy and non-projectivity, and discusses their application to finite, super-, and infinite populations.
Contribution
It provides a comprehensive review of ERGMs, clarifies core statistical concepts, and discusses likelihood-based inference across different population scenarios.
Findings
Well-posed ERGMs can be stable and well-behaved.
Likelihood-based inference does not require projectivity.
Application to human brain networks demonstrates practical utility.
Abstract
Exponential-family Random Graph Models (ERGMs) constitute a large statistical framework for modeling sparse and dense random graphs, short- and long-tailed degree distributions, covariates, and a wide range of complex dependencies. Special cases of ERGMs are generalized linear models (GLMs), Bernoulli random graphs, -models, -models, and models related to Markov random fields in spatial statistics and other areas of statistics. While widely used in practice, questions have been raised about the theoretical properties of ERGMs. These include concerns that some ERGMs are near-degenerate and that many ERGMs are non-projective. To address them, careful attention must be paid to model specifications and their underlying assumptions, and in which inferential settings models are employed. As we discuss, near-degeneracy can affect simplistic ERGMs lacking structure, but well-posed…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
