The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Crossover from scale-free to spatial networks
Open accessAbstract
In many networks such as transportation or communication networks, distance is certainly a relevant parameter. In addition, real-world examples suggest that when long-range links are existing, they usually connect to hubs—the well-connected nodes. We analyze a simple model which combines both these ingredients—preferential attachment and distance selection characterized by a typical finite “interaction range”. We study the crossover from the scale-free to the “spatial” network as the interaction range decreases and we propose scaling forms for different quantities describing the network. In particular, when the distance effect is important i) the connectivity distribution has a cut-off depending on the node density, ii) the clustering coefficient is very high, and iii) we observe a positive maximum in the degree correlation (assortativity) whose numerical value is in agreement with empirical measurements. Finally, we show that if the total length is fixed, the optimal network which minimizes both the total length and the diameter lies in between the scale-free and spatial networks. This phenomenon could play an important role in the formation of networks and could be an explanation for the high clustering and the positive assortativity which are non-trivial features observed in many real-world examples.
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
Itzykson, C., & Drouffe, J.-M. (1989) · doi:10.1017/cbo9780511622779 · Cited by 885
Cited by
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Modeling the world-wide airport network
Guimerá, R., & Amaral, L. A. N. (2004) · The European Physical Journal B · doi:10.1140/epjb/e2004-00131-0 · Cited by 466
Geographical dispersal of mobile communication networks
Lambiotte, R., Blondel, V. D., de Kerchove, C., Huens, E., Prieur, C., Smoreda, Z., & Van Dooren, P. (2008) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2008.05.014 · Cited by 455
Spatial network structure and amphibian persistence in stochastic environments
Fortuna, M. A., Gómez-Rodríguez, C., & Bascompte, J. (2006) · Proceedings of the Royal Society B: Biological Sciences · doi:10.1098/rspb.2005.3448 · Cited by 256
Euclidean distance between syntactically linked words
Ferrer i Cancho, R. (2004) · Physical Review E · doi:10.1103/physreve.70.056135 · Cited by 212
Metadata
- Authors
- Barthélemy, M.
- Venue
- Europhysics Letters (EPL)
- Publisher
- IOP Publishing
- Published
- 2003-09
- Volume
- 63
- Issue
- 6
- Pages
- 915-921
- ISSN
- 0295-5075 (ISSN-L)
- 1286-4854
- OpenAlex
- W2007704697
- Cited by
- 228
- References
- 1
- FWCI
- 4.89
- 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: Crossover from scale-free to spatial networks. https://app.cochat.ai/papers/10.1209/epl/i2003-00600-6
- The paper
- Barthélemy, M. (2003). Crossover from scale-free to spatial networks. Europhysics Letters (EPL). https://doi.org/10.1209/epl/i2003-00600-6
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.