The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Scale-Free Networks on Lattices
Open accessAbstract
We suggest a method for embedding scale-free networks, with degree distribution $P(k)\ensuremath{\sim}{k}^{\ensuremath{-}\ensuremath{\lambda}}$, in regular Euclidean lattices accounting for geographical properties. The embedding is driven by a natural constraint of minimization of the total length of the links in the system. We find that all networks with $\ensuremath{\lambda}>2$ can be successfully embedded up to a (Euclidean) distance $\ensuremath{\xi}$ which can be made as large as desired upon the changing of an external parameter. Clusters of successive chemical shells are found to be compact (the fractal dimension is ${d}_{f}=d$), while the dimension of the shortest path between any two sites is smaller than 1: ${d}_{\mathrm{m}\mathrm{i}\mathrm{n}}=(\ensuremath{\lambda}\ensuremath{-}2)/(\ensuremath{\lambda}\ensuremath{-}1\ensuremath{-}1/d)$, contrary to all other known examples of fractals and disordered lattices.
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
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00083-9 · Cited by 2,810
Size-dependent degree distribution of a scale-free growing network
Dorogovtsev, S. N., Mendes, J. F. F., & Samukhin, A. N. (2001) · Physical Review E · doi:10.1103/physreve.63.062101 · Cited by 311
Cited by
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
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
Barthélemy, M. (2011) · Physics Reports · doi:10.1016/j.physrep.2010.11.002 · Cited by 2,469
Keeling, M. J., & Eames, K. T. D. (2005) · Journal of The Royal Society Interface · doi:10.1098/rsif.2005.0051 · Cited by 1,876
Efficient Immunization Strategies for Computer Networks and Populations
Cohen, R., Havlin, S., & ben-Avraham, D. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.247901 · Cited by 1,162
Self-citation
Metadata
- Authors
- Rozenfeld, A. F., Cohen, R., ben-Avraham, D., & Havlin, S.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2002-11-01
- Volume
- 89
- Issue
- 21
- Pages
- 218701-218701
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2135641060
- Cited by
- 178
- References
- 2
- FWCI
- 7.94
- 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 on Lattices. https://app.cochat.ai/papers/10.1103/physrevlett.89.218701
- The paper
- Rozenfeld, A. F., Cohen, R., ben-Avraham, D., & Havlin, S. (2002). Scale-Free Networks on Lattices. Physical Review Letters. https://doi.org/10.1103/physrevlett.89.218701
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.