pith. sign in

arxiv: 1011.1937 · v2 · pith:GEJ2YB3Unew · submitted 2010-11-08 · 📊 stat.ME

A Separable Model for Dynamic Networks

classification 📊 stat.ME
keywords modelnetworksseparabledevelopdynamicmodelsnetworkalgorithms
0
0 comments X
read the original abstract

Models of dynamic networks --- networks that evolve over time --- have manifold applications. We develop a discrete-time generative model for social network evolution that inherits the richness and flexibility of the class of exponential-family random graph models. The model --- a Separable Temporal ERGM (STERGM) --- facilitates separable modeling of the tie duration distributions and the structural dynamics of tie formation. We develop likelihood-based inference for the model, and provide computational algorithms for maximum likelihood estimation. We illustrate the interpretability of the model in analyzing a longitudinal network of friendship ties within a school.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.