The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Computing global structural balance in large-scale signed social networks
Open accessAbstract
Structural balance theory affirms that signed social networks (i.e., graphs whose signed edges represent friendly/hostile interactions among individuals) tend to be organized so as to avoid conflictual situations, corresponding to cycles of negative parity. Using an algorithm for ground-state calculation in large-scale Ising spin glasses, in this paper we compute the global level of balance of very large online social networks and verify that currently available networks are indeed extremely balanced. This property is explainable in terms of the high degree of skewness of the sign distributions on the nodes of the graph. In particular, individuals linked by a large majority of negative edges create mostly “apparent disorder,” rather than true “frustration.”
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
Modularity and community structure in networks
Newman, M. E. J. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0601602103 · Cited by 12,256
Network motifs: simple building blocks of complex networks.
Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., & Alon, U. (2002) · Science · doi:10.1126/science.298.5594.824 · Cited by 7,368
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Cited by
Newman, M. (2018) · doi:10.1093/oso/9780198805090.001.0001 · Cited by 2,297
Consensus Problems on Networks With Antagonistic Interactions
Altafini, C. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2224251 · Cited by 2,109
Self-citationA tutorial on modeling and analysis of dynamic social networks. Part I
Proskurnikov, A. V., & Tempo, R. (2017) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2017.03.002 · Cited by 553
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
Interval Bipartite Consensus of Networked Agents Associated With Signed Digraphs
Meng, D., Du, M., & Jia, Y. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2528539 · Cited by 401
Metadata
- Authors
- Facchetti, G., Iacono, G., & Altafini, C.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2011-12-13
- Volume
- 108
- Issue
- 52
- Pages
- 20953-20958
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2105951053
- Cited by
- 440
- References
- 5
- FWCI
- 11.70
- 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: Computing global structural balance in large-scale signed social networks. https://app.cochat.ai/papers/10.1073/pnas.1109521108
- The paper
- Facchetti, G., Iacono, G., & Altafini, C. (2011). Computing global structural balance in large-scale signed social networks. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.1109521108
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.
