O'Reilly logo

Complex Networks by Shlomo Havlin, Reuven Cohen

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

8   Distances in geographically embedded networks

We now address the geometrical properties of the networks, arising from their embedding in Euclidean space (see Section 4.6). For this purpose, it is useful to consider the spatial arrangement of the networks as measured both in a Euclidean metric and in chemical space. The chemical distance l between any two nodes is the minimal number of links between them (shortest path). Thus, if the distance between the two nodes is r, then imagedefines the shortest path exponent dmin. We will see that for scale-free networks embedded in d>1 lattices, dmin<1, contrary to all known fractals and disordered media where ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required