The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Closure, connectivity and degree distributions: Exponential random graph (p*) models for directed social 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
Social Network Analysis: Methods and Applications
Wasserman, S. S., & Faust, K. (1994) · Cited by 17,962
Spatial Interaction and the Statistical Analysis of Lattice Systems
Besag, J. (1974) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1974.tb00999.x · Cited by 6,067
Models and Methods in Social Network Analysis
(2005) · Cambridge University Press eBooks · doi:10.1017/cbo9780511811395 · Cited by 2,441
Social Network Analysis: Methods and Applications
Lazega, E., Wasserman, S., & Faust, K. (1995) · Revue Française de Sociologie · doi:10.2307/3322457 · Cited by 1,558
New Specifications for Exponential Random Graph Models
Snijders, T. A. B., Pattison, P. E., Robins, G. L., & Handcock, M. S. (2006) · Sociological Methodology · doi:10.1111/j.1467-9531.2006.00176.x · Cited by 1,445
Self-citationAn Exponential Family of Probability Distributions for Directed Graphs
Holland, P. W., & Leinhardt, S. (1981) · Journal of the American Statistical Association · doi:10.1080/01621459.1981.10477598 · Cited by 1,190
Logit Models and Logistic Regressions for Social Networks: I. An Introduction to Markov Graphs and p
Wasserman, S., & Pattison, P. (1996) · Psychometrika · doi:10.1007/bf02294547 · Cited by 950
Self-citationRecent developments in exponential random graph (p*) models for social networks
Robins, G., Snijders, T., Wang, P., Handcock, M., & Pattison, P. (2007) · Social Networks · doi:10.1016/j.socnet.2006.08.003 · Cited by 832
Self-citationMarkov 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
Cited by
The Corner and the Crew: The Influence of Geography and Social Networks on Gang Violence
Papachristos, A. V., Hureau, D. M., & Braga, A. A. (2013) · American Sociological Review · doi:10.1177/0003122413486800 · Cited by 432
A Quantitative Exploration on Reasons for Citing Articles from the Perspective of Cited Authors
Wang, B., Bu, Y., & Xu, Y. (2018) · Scientometrics · doi:10.1007/s11192-018-2787-6 · Cited by 19
Metadata
- Authors
- Robins, G., Pattison, P., & Wang, P.
- Venue
- Social Networks
- Publisher
- Elsevier BV
- Published
- 2009-05
- Volume
- 31
- Issue
- 2
- Pages
- 105-117
- ISSN
- 0378-8733 (ISSN-L)
- OpenAlex
- W2088428327
- Cited by
- 305
- References
- 22
- FWCI
- 9.43
- Type
- journal article
- Language
- en
- Open access
- closed
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: Closure, connectivity and degree distributions: Exponential random graph (p*) models for directed social networks. https://app.cochat.ai/papers/10.1016/j.socnet.2008.10.006
- The paper
- Robins, G., Pattison, P., & Wang, P. (2009). Closure, connectivity and degree distributions: Exponential random graph (p*) models for directed social networks. Social Networks. https://doi.org/10.1016/j.socnet.2008.10.006
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.
