title: Scale-free networks on lattices.
abstract: We suggest a method for embedding scale-free networks, with degree distribution Pk approximately k(-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 lambda>2 can be successfully embedded up to a (Euclidean) distance 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 df=d), while the dimension of the shortest path between any two sites is smaller than 1: dmin=(lambda-2)/(lambda-1-1/d), contrary to all other known examples of fractals and disordered lattices.
authors.affiliation: Minerva Center and Department of Physics, Bar-Ilan University, Ramat-Gan 52900, Israel.
authors.forename: Alejandro F
authors.initials: AF
authors.lastname: Rozenfeld
authors.forename: Reuven
authors.initials: R
authors.lastname: Cohen
authors.forename: Daniel
authors.initials: D
authors.lastname: Ben-Avraham
authors.forename: Shlomo
authors.initials: S
authors.lastname: Havlin
mesh_terms: D003195:Computer Communication Networks; D020407:Internet; D008954:Models, Biological; D008962:Models, Theoretical; D012944:Social Support