Scale-Free Networks on Lattices

Alejandro F. Rozenfeld, Reuven Cohen, Daniel ben-Avraham, Shlomo Havlin

Research output: Contribution to journalArticlepeer-review

173 Scopus citations

Abstract

We suggest a method for embedding scale-free networks, with degree distribution [Formula presented], 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 [Formula presented] can be successfully embedded up to a (Euclidean) distance [Formula presented] 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 [Formula presented]), while the dimension of the shortest path between any two sites is smaller than 1: [Formula presented], contrary to all other known examples of fractals and disordered lattices.

Original languageEnglish
JournalPhysical Review Letters
Volume89
Issue number21
DOIs
StatePublished - 18 Nov 2002

Fingerprint

Dive into the research topics of 'Scale-Free Networks on Lattices'. Together they form a unique fingerprint.

Cite this