The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Triadic closure in two-mode networks: Redefining the global and local clustering coefficients
Open accessAbstract
Abstract As the vast majority of network measures are defined for one-mode networks, two-mode networks often have to be projected onto one-mode networks to be analyzed. A number of issues arise in this transformation process, especially when analyzing ties among nodes’ contacts. For example, the values attained by the global and local clustering coefficients on projected random two-mode networks deviate from the expected values in corresponding classical one-mode networks. Moreover, both the local clustering coefficient and constraint (structural holes) are inversely associated to nodes’ two-mode degree. To overcome these issues, this paper proposes redefinitions of the clustering coefficients for two-mode 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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Granovetter, M. S. (1973) · American Journal of Sociology · doi:10.1086/225469 · Cited by 40,491
Social Capital in the Creation of Human Capital
Coleman, J. S. (1988) · American Journal of Sociology · doi:10.1086/228943 · Cited by 26,975
Social Capital in the Creation of Human Capital
COLEMAN, J. (2000) · Knowledge and Social Capital · doi:10.1016/b978-0-7506-7222-1.50005-2 · Cited by 21,666
Social Network Analysis: Methods and Applications
Wasserman, S. S., & Faust, K. (1994) · Cited by 17,961
Erdős, P., & Rényi, A. (2022) · Publicationes Mathematicae Debrecen · doi:10.5486/pmd.1959.6.3-4.12 · Cited by 5,337
Kilzer, E., & Wolff, K. H. (1950) · The American Catholic Sociological Review · doi:10.2307/3707052 · Cited by 4,521
The architecture of complex weighted networks
Barrat, A., Barthélemy, M., Pastor-Satorras, R., & Vespignani, A. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0400087101 · Cited by 4,218
The Sociology of Georg Simmel.
Gerth, H., & Wolff, K. (1950) · American Sociological Review · doi:10.2307/2086932 · Cited by 2,630
Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality
Newman, M. E. J. (2001) · Physical Review E · doi:10.1103/physreve.64.016132 · Cited by 2,613
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
The Geography of Complex Knowledge
Balland, P.-A., & Rigby, D. (2017) · Economic Geography · doi:10.1080/00130095.2016.1205947 · Cited by 710
Simplicial closure and higher-order link prediction
Benson, A. R., Abebe, R., Schaub, M. T., Jadbabaie, A., & Kleinberg, J. (2018) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1800683115 · Cited by 548
Representation learning for dynamic graphs: A survey
Kazemi, S. M., Goel, R., Jain, K., Kobyzev, I., Sethi, A., Forsyth, P., & Poupart, P. (2019) · arXiv · doi:10.48550/arxiv.1905.11485 · Cited by 338
Topological Strata of Weighted Complex Networks
Petri, G., Scolamiero, M., Donato, I., & Vaccarino, F. (2013) · PLoS ONE · doi:10.1371/journal.pone.0066506 · Cited by 214
Metadata
- Authors
- Opsahl, T.
- Venue
- Social Networks
- Publisher
- Elsevier BV
- Published
- 2013-05
- Volume
- 35
- Issue
- 2
- Pages
- 159-167
- ISSN
- 0378-8733 (ISSN-L)
- OpenAlex
- W1970463918
- Cited by
- 488
- References
- 25
- FWCI
- 14.44
- Type
- journal article
- Language
- en
- Open access
- green
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: Triadic closure in two-mode networks: Redefining the global and local clustering coefficients. https://app.cochat.ai/papers/10.1016/j.socnet.2011.07.001
- The paper
- Opsahl, T. (2013). Triadic closure in two-mode networks: Redefining the global and local clustering coefficients. Social Networks. https://doi.org/10.1016/j.socnet.2011.07.001
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.
