Scale-Free Networks on Lattices

Alejandro F. Rozenfeld, Reuven Cohen, Daniel ben-Avraham, and Shlomo Havlin
Phys. Rev. Lett. 89, 218701 – Published 1 November 2002

Abstract

We suggest a method for embedding scale-free networks, with degree distribution P(k)kλ, 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 λ>2 can be successfully embedded up to a (Euclidean) distance ξ 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 df=d), while the dimension of the shortest path between any two sites is smaller than 1: dmin=(λ2)/(λ11/d), contrary to all other known examples of fractals and disordered lattices.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Received 31 May 2002

DOI:https://doi.org/10.1103/PhysRevLett.89.218701

©2002 American Physical Society

Authors & Affiliations

Alejandro F. Rozenfeld1, Reuven Cohen1, Daniel ben-Avraham2, and Shlomo Havlin1

  • 1Minerva Center and Department of Physics, Bar-Ilan University, Ramat-Gan 52900, Israel
  • 2Department of Physics, Clarkson University, Potsdam, New York 13699-5820

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 89, Iss. 21 — 18 November 2002

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review Letters

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×