Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 245

The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.

Scale-free networks from optimal design

Open access
Valverde, S, Cancho, R. Ferrer, Solé, R. V · 2002 · Europhysics Letters (EPL)

Abstract

A large number of complex networks, both natural and artificial, share the presence of highly heterogeneous, scale-free degree distributions. A few mechanisms for the emergence of such patterns have been suggested, optimization not being one of them. In this letter we present the first evidence for the emergence of scaling (and the presence of small-world behavior) in software architecture graphs from a well-defined local optimization process. Although the rules that define the strategies involved in software engineering should lead to a tree-like structure, the final net is scale-free, perhaps reflecting the presence of conflicting constraints unavoidable in a multidimensional optimization process. The consequences for other complex networks are outlined.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1209/epl/i2002-00248-2

Cites

4 of 4 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 4 references

Cited by

See all 245

Metadata

Authors
Valverde, S., Cancho, R. F., & Solé, R. V.
Venue
Europhysics Letters (EPL)
Published
2002-11
Volume
60
Issue
4
Pages
512-517
ISSN
  • 0295-5075 (ISSN-L)
  • 1286-4854
OpenAlex
W2026500287
Cited by
245
References
4
FWCI
5.64
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: Scale-free networks from optimal design. https://app.cochat.ai/papers/10.1209/epl/i2002-00248-2
The paper
Valverde, S., Cancho, R. F., & Solé, R. V. (2002). Scale-free networks from optimal design. Europhysics Letters (EPL). https://doi.org/10.1209/epl/i2002-00248-2

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.