The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Complex Cooperative Networks from Evolutionary Preferential Attachment
Open accessAbstract
In spite of its relevance to the origin of complex networks, the interplay between form and function and its role during network formation remains largely unexplored. While recent studies introduce dynamics by considering rewiring processes of a pre-existent network, we study network growth and formation by proposing an evolutionary preferential attachment model, its main feature being that the capacity of a node to attract new links depends on a dynamical variable governed in turn by the node interactions. As a specific example, we focus on the problem of the emergence of cooperation by analyzing the formation of a social network with interactions given by the Prisoner's Dilemma. The resulting networks show many features of real systems, such as scale-free degree distributions, cooperative behavior and hierarchical clustering. Interestingly, results such as the cooperators being located mostly on nodes of intermediate degree are very different from the observations of cooperative behavior on static networks. The evolutionary preferential attachment mechanism points to an evolutionary origin of scale-free networks and may help understand similar feedback problems in the dynamics of complex networks by appropriately choosing the game describing the interaction of nodes.
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
Five Rules for the Evolution of Cooperation
Nowak, M. A. (2006) · Science · doi:10.1126/science.1133755 · Cited by 5,894
A simple rule for the evolution of cooperation on graphs and social networks
Ohtsuki, H., Hauert, C., Lieberman, E., & Nowak, M. A. (2006) · Nature · doi:10.1038/nature04605 · Cited by 2,208
Cooperation Prevails When Individuals Adjust Their Social Ties
Santos, F. C., Pacheco, J. M., & Lenaerts, T. (2006) · PLoS Computational Biology · doi:10.1371/journal.pcbi.0020140 · Cited by 556
Cited by
A Comparative Analysis of Community Detection Algorithms on Artificial Networks
Yang, Z., Algesheimer, R., & Tessone, C. J. (2016) · Zurich Open Repository and Archive (University of Zurich) · doi:10.5167/uzh-127494 · Cited by 685
Universal scaling for the dilemma strength in evolutionary games
Wang, Z., Kokubo, S., Jusup, M., & Tanimoto, J. (2015) · Physics of Life Reviews · doi:10.1016/j.plrev.2015.04.033 · Cited by 586
A Comparative Analysis of Community Detection Algorithms on Artificial Networks
Yang, Z., Algesheimer, R., & Tessone, C. J. (2016) · Scientific Reports · doi:10.1038/srep30750 · Cited by 578
Win-Stay-Lose-Learn Promotes Cooperation in the Spatial Prisoner's Dilemma Game
Liu, Y., Chen, X., Zhang, L., Wang, L., & Perc, M. (2012) · PLoS ONE · doi:10.1371/journal.pone.0030689 · Cited by 527
Optimal interdependence between networks for the evolution of cooperation
Wang, Z., Szolnoki, A., & Perc, M. (2013) · Scientific Reports · doi:10.1038/srep02470 · Cited by 311
Metadata
- Authors
- Poncela, J., Gómez-Gardeñes, J., Floría, L. M., Sánchez, A., & Moreno, Y.
- Venue
- PLoS ONE
- Publisher
- Public Library of Science (PLoS)
- Published
- 2008-06-18
- Volume
- 3
- Issue
- 6
- Pages
- e2449
- ISSN
- 1932-6203 (ISSN-L)
- OpenAlex
- W2139426230
- Cited by
- 212
- References
- 3
- FWCI
- 18.86
- 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: Complex Cooperative Networks from Evolutionary Preferential Attachment. https://app.cochat.ai/papers/10.1371/journal.pone.0002449
- The paper
- Poncela, J., Gómez-Gardeñes, J., Floría, L. M., Sánchez, A., & Moreno, Y. (2008). Complex Cooperative Networks from Evolutionary Preferential Attachment. PLoS ONE. https://doi.org/10.1371/journal.pone.0002449
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.