Optimization in Complex Networks
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Many complex systems can be described in terms of networks of interacting units. Recent studies have shown that a wide class of both natural and artificial nets display a surprisingly widespread feature: the presence of highly heterogeneous distributions of links, providing an extraordinary source of robustness against perturbations. Although most theories concerning the origin of these topologies use growing graphs, here we show that a simple optimization process can also account for the observed regularities displayed by most complex nets. Using an evolutionary algorithm involving minimization of link density and average distance, four major types of networks are encountered: (a) sparse exponential-like networks, (b) sparse scale-free networks, (c) star networks and (d) highly dense networks, apparently defining three major phases. These constraints provide a new explanation for scaling of exponent about -3. The evolutionary consequences of these results are outlined.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A General Model for the Origin of Allometric Scaling Laws in Biology
West, G. B., Brown, J. H., & Enquist, B. J. (1997) · Science · doi:10.1126/science.276.5309.122 · Cited by 5,016
Topology of technology graphs: Small world patterns in electronic circuits
Cancho, R. F. I., Janssen, C., & Solé, R. V. (2001) · Physical Review E · doi:10.1103/physreve.64.046119 · Cited by 265
Self-citationRobustness as an evolutionary principle
Bornholdt, S., & Sneppen, K. (2000) · Proceedings of the Royal Society of London. Series B: Biological Sciences · doi:10.1098/rspb.2000.1280 · Cited by 132
Cited by
Barthélemy, M. (2011) · Physics Reports · doi:10.1016/j.physrep.2010.11.002 · Cited by 2,469
Scale-Free Networks: Complex Webs in Nature and Technology
Caldarelli, G. (2007) · doi:10.1093/acprof:oso/9780199211517.001.0001 · Cited by 748
Statistical Mechanics of Complex Networks
Thurner, S. (2009) · Analysis of Complex Networks · doi:10.1002/9783527627981.ch2 · Cited by 337
Information Theory of Complex Networks: On Evolution and Architectural Constraints
Solé, R. V., & Valverde, S. (2004) · Lecture Notes in Physics · doi:10.1007/978-3-540-44485-5_9 · Cited by 337
Self-citationA MODEL OF LARGE-SCALE PROTEOME EVOLUTION
SOLÉ, R. V., PASTOR-SATORRAS, R., SMITH, E., & KEPLER, T. B. (2002) · Advances in Complex Systems · doi:10.1142/s021952590200047x · Cited by 330
Self-citation
Metadata
- Authors
- Cancho, R. F. I., & Solé, R. V.
- Venue
- Lecture Notes in Physics
- Publisher
- Springer Berlin Heidelberg
- Published
- 2003
- Pages
- 114-126
- ISSN
- 0075-8450 (ISSN-L)
- 1616-6361
- OpenAlex
- W2113985822
- Cited by
- 146
- References
- 3
- FWCI
- 17.27
- Type
- book chapter
- 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
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.