Electronic Journal of Statistics

Discrete temporal models of social networks

Steve Hanneke, Wenjie Fu, and Eric P. Xing

Full-text: Open access


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 maximum likelihood estimation algorithms. We discuss models of this type and their properties, and give examples, as well as a demonstration of their use for hypothesis testing and classification. We believe our temporal ERG models represent a useful new framework for modeling time-evolving social networks, and rewiring networks from other domains such as gene regulation circuitry, and communication networks.

Article information

Electron. J. Statist., Volume 4 (2010), 585-605.

First available in Project Euclid: 16 June 2010

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier


Hanneke, Steve; Fu, Wenjie; Xing, Eric P. Discrete temporal models of social networks. Electron. J. Statist. 4 (2010), 585--605. doi:10.1214/09-EJS548. https://projecteuclid.org/euclid.ejs/1276694116

Export citation


  • Airoldi, E. M., Blei, D. M., Fienberg, S. E., and Xing, E. P. (2008). Mixed membership stochastic blockmodels., Journal of Machine Learning Research , 9, 1981–2014.
  • Carreira-Perpignán, M. and Hinton, G. E. (2005). On contrastive divergence learning. In, Artificial Intelligence and Statistics .
  • Frank, O. and Strauss, D. (1986). Markov graphs., Journal of the American Statistical Association , 81.
  • Geyer, C. and Thompson, E. (1992). Constrained Monte Carlo maximum likelihood for dependent data., Journal of the Royal Statistical Society, B , 54(3), 657–699.
  • Handcock, M. S. (2003)., Assessing Degeneracy in Statistical Models of Social Networks . Center for Statistics and the Social Sciences, University of Washington, Working Paper No. 39.
  • Handcock, M. S., Raftery, A. E., and Tantrum, J. (2007). Model-based clustering for social networks., Journal of the Royal Statistical Society A , 170, 301–354.
  • Hunter, D. R., Goodreau, S. M., and Handcock, M. S. (2008). Goodness of fit of social network models., Journal of the American Statistical Association , 103(1), 248–258.
  • Joachims, T. (2003). Transductive learning via spectral graph partitioning. In, Proceedings of the International Conference on Machine Learning .
  • McLachlan, G. and Krishnan, T. (1997)., The EM algorithm and Extensions . Wiley.
  • Mitchell, M. (1996)., An Introduction to Genetic Algorithms . MIT Press.
  • Opper, M. and Saad, D., editors (2001)., Advanced Mean Field Methods: Theory and Practice . MIT Press.
  • Robins, G. L. and Pattison, P. E. (2001). Random graph models for temporal processes in social networks., Journal of Mathematical Sociology , 25, 5–41.
  • Robins, G. L. and Pattison, P. E. (2005). Interdependencies and social processes: Generalized dependence structures. In P. Carrington, J. Scott, and S. Wasserman, editors, Models and Methods in Social Network Analysis . Cambridge University Press.
  • Snijders, T. (2006). Statistical methods for network dynamics. In S. L. et al., editor, Proceedings of the XLIII Scientific Meeting, Italian Statistical Society , pages 281–296.
  • Snijders, T. A. B. (2002). Markov Chain Monte Carlo estimation of exponential random graph models., Journal of Social Structure , 3(2).
  • Wainwright, M., Jaakkola, T., and Willsky, A. (2005). A new class of upper bounds on the log partition function., IEEE Trans. on Information Theory , 51(7).
  • Wasserman, S. and Robins, G. (2005). An introduction to random graphs, dependence graphs, and p*. In P. Carrington, J. Scott, and S. Wasserman, editors, Models and Methods in Social Network Analysis . Cambridge University Press.