The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Discrete temporal models of social networks
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An Introduction to Genetic Algorithms
Mitchell, M. (1996) · doi:10.7551/mitpress/3927.001.0001 · Cited by 11,340
The EM Algorithm and Extensions
Kushary, D. (1998) · Technometrics · doi:10.1080/00401706.1998.10485534 · Cited by 5,417
Frank, O., & Strauss, D. (1986) · Journal of the American Statistical Association · doi:10.1080/01621459.1986.10478342 · Cited by 893
Constrained Monte Carlo Maximum Likelihood for Dependent Data
Geyer, C. J., & Thompson, E. A. (1992) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1992.tb01443.x · Cited by 874
Mixed membership stochastic blockmodels
Airoldi, E. M., Blei, D. M., Fienberg, S. E., & Xing, E. P. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0705.4485 · Cited by 781
Self-citationModel-Based Clustering for Social Networks
Handcock, M. S., Raftery, A. E., & Tantrum, J. M. (2007) · Journal of the Royal Statistical Society Series A: Statistics in Society · doi:10.1111/j.1467-985x.2007.00471.x · Cited by 779
Markov chain Monte Carlo estimation of exponential random graph models
Snijders, T. A. B. (2002) · Cited by 712
Goodness of Fit of Social Network Models
Hunter, D. R., Goodreau, S. M., & Handcock, M. S. (2008) · Journal of the American Statistical Association · doi:10.1198/016214507000000446 · Cited by 689
Transductive learning via spectral graph partitioning
Joachims, T. (2003) · Cited by 633
On Contrastive Divergence Learning.
Carreira-Perpiñán, M. Á., & Hinton, G. E. (2005) · Cited by 630
Cited by
Holme, P., & Saramäki, J. (2012) · Physics Reports · doi:10.1016/j.physrep.2012.03.001 · Cited by 2,736
Temporal dynamics and network analysis
Blonder, B., Wey, T. W., Dornhaus, A., James, R., & Sih, A. (2012) · Methods in Ecology and Evolution · doi:10.1111/j.2041-210x.2012.00236.x · Cited by 254
Navigating the Range of Statistical Tools for Inferential Network Analysis
Cranmer, S. J., Leifeld, P., McClurg, S. D., & Rolfe, M. (2017) · American Journal of Political Science · doi:10.1111/ajps.12263 · Cited by 214
The Incidental Pundit: Who Talks Politics with Whom, and Why?
Minozzi, W., Song, H., Lazer, D. M. J., Neblo, M. A., & Ognyanova, K. (2020) · American Journal of Political Science · doi:10.1111/ajps.12469 · Cited by 123
Czarna, A. Z., Leifeld, P., Śmieja, M., Dufner, M., & Salovey, P. (2016) · Personality and Social Psychology Bulletin · doi:10.1177/0146167216666265 · Cited by 76
Metadata
- Authors
- Hanneke, S., Fu, W., & Xing, E. P.
- Venue
- Electronic Journal of Statistics
- Publisher
- Institute of Mathematical Statistics
- Published
- 2010-01-01
- Volume
- 4
- Issue
- none
- Pages
- 585-605
- ISSN
- 1935-7524 (ISSN-L)
- OpenAlex
- W2180060901
- Cited by
- 587
- References
- 17
- FWCI
- 14.56
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Discrete temporal models of social networks. https://app.cochat.ai/papers/10.1214/09-ejs548
- The paper
- Hanneke, S., Fu, W., & Xing, E. P. (2010). Discrete temporal models of social networks. Electronic Journal of Statistics. https://doi.org/10.1214/09-ejs548
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
