Approximations for STERGMs Based on Cross-Sectional Data
Chad Klumb, Martina Morris, Steven M. Goodreau, Samuel M. Jenness

TL;DR
This paper improves approximation methods for Separable Temporal ERGMs (STERGMs), enabling better modeling of network dynamics from cross-sectional data, especially in sparse and dyad-dependent cases, with theoretical guarantees.
Contribution
It introduces a new approximation for STERGMs that outperforms previous methods in sparse dyad-independent models and extends theoretical results to dyad-dependent cases.
Findings
New approximation outperforms previous in sparse dyad-independent models
Both approximations are asymptotically exact as time step approaches zero
Continuous-time limit captures desired equilibrium behaviors
Abstract
Temporal exponential-family random graph models (TERGMs) are a flexible class of network models for the dynamics of tie formation and dissolution. In practice, separable TERGMs (STERGMs) are the subclass most often used, as these permit estimation from inexpensive cross-sectional study designs, and benefit from approximations designed to reduce the computational burden. Improving the approximations are the focus of this paper. We extend the work of Carnegie et al., which addressed the problem of constructing a STERGM with two specific equilibrium properties: a cross-sectional distribution defined by a given exponential-family random graph model (ERGM), and tie durations defined by given constant hazards of dissolution. We start with Carnegie et al.'s observation that the exact result is tractable in the dyad-independent case, and then show that taking the sparse limit of the exact…
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.
Taxonomy
TopicsComplex Network Analysis Techniques · Spatial and Panel Data Analysis
