Discrete Temporal Models of Social Networks
Abstract
We propose a family of statistical models for social network evolution over time, which represents an extension of Exponential Random Graph Models (ERGMs). Many of the methods for ERGMs are readily adapted for these models, including MCMC maximum likelihood estimation algorithms. We discuss models of this type and give examples, as well as a demonstration of their use for hypothesis testing and classification.
Cite
Text
Hanneke and Xing. "Discrete Temporal Models of Social Networks." International Conference on Machine Learning, 2006. doi:10.1007/978-3-540-73133-7_9Markdown
[Hanneke and Xing. "Discrete Temporal Models of Social Networks." International Conference on Machine Learning, 2006.](https://mlanthology.org/icml/2006/hanneke2006icml-discrete/) doi:10.1007/978-3-540-73133-7_9BibTeX
@inproceedings{hanneke2006icml-discrete,
title = {{Discrete Temporal Models of Social Networks}},
author = {Hanneke, Steve and Xing, Eric P.},
booktitle = {International Conference on Machine Learning},
year = {2006},
pages = {115-125},
doi = {10.1007/978-3-540-73133-7_9},
url = {https://mlanthology.org/icml/2006/hanneke2006icml-discrete/}
}