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

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 access
Rozenfeld, Alejandro F., Cohen, Reuven, ben-Avraham, Daniel, Havlin, Shlomo · 2002 · Physical Review Letters

Abstract

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.

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

Integrity signals

Registry

Crossref · 10.1103/physrevlett.89.218701

Cites

2 of 2 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 2 references

Cited by

See all 178

Metadata

Authors
Rozenfeld, A. F., Cohen, R., ben-Avraham, D., & Havlin, S.
Venue
Physical Review Letters
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.