| Literature DB >> 24443639 |
Pavel N Krivitsky1, Mark S Handcock2.
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.Entities:
Keywords: Exponential random graph model; Longitudinal; Markov chain Monte Carlo; Maximum likelihood estimation; Social networks
Year: 2014 PMID: 24443639 PMCID: PMC3891677 DOI: 10.1111/rssb.12014
Source DB: PubMed Journal: J R Stat Soc Series B Stat Methodol ISSN: 1369-7412 Impact factor: 4.488