The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Exponential random graph () models for affiliation 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., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
Cited by
Networks beyond pairwise interactions: Structure and dynamics
Battiston, F., Cencetti, G., Iacopini, I., Latora, V., Lucas, M., Patania, A., Young, J.-G., & Petri, G. (2020) · Physics Reports · doi:10.1016/j.physrep.2020.05.004 · Cited by 1,602
Triadic closure in two-mode networks: Redefining the global and local clustering coefficients
Opsahl, T. (2013) · Social Networks · doi:10.1016/j.socnet.2011.07.001 · Cited by 488
Statistical Models for Social Networks
Snijders, T. A. B. (2011) · Annual Review of Sociology · doi:10.1146/annurev.soc.012809.102709 · Cited by 460
What are higher-order networks?
Bick, C., Gross, E., Harrington, H. A., & Schaub, M. T. (2023) · SIAM Review · doi:10.1137/21m1414024 · Cited by 420
Exponential random graph models for multilevel networks
Wang, P., Robins, G., Pattison, P., & Lazega, E. (2013) · Social Networks · doi:10.1016/j.socnet.2013.01.004 · Cited by 374
Self-citation
Metadata
- Authors
- Wang, P., Sharpe, K., Robins, G. L., & Pattison, P. E.
- Venue
- Social Networks
- Publisher
- Elsevier BV
- Published
- 2009-01
- Volume
- 31
- Issue
- 1
- Pages
- 12-25
- ISSN
- 0378-8733 (ISSN-L)
- OpenAlex
- W1964283622
- Cited by
- 203
- References
- 2
- FWCI
- 4.71
- 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: Exponential random graph () models for affiliation networks. https://app.cochat.ai/papers/10.1016/j.socnet.2008.08.002
- The paper
- Wang, P., Sharpe, K., Robins, G. L., & Pattison, P. E. (2009). Exponential random graph () models for affiliation networks. Social Networks. https://doi.org/10.1016/j.socnet.2008.08.002
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.