Complex networks embedded in space: Dimension and scaling relations between mass, topological distance and Euclidean distance

Abstract

Many real networks are embedded in space, where in some of them the links length decay as a power law distribution with distance. Indications that such systems can be characterized by the concept of dimension were found recently. Here, we present further support for this claim, based on extensive numerical simulations for model networks embedded on lattices of dimensions de=1 and de=2. We evaluate the dimension d from the power law scaling of (a) the mass of the network with the Euclidean radius r and (b) the probability of return to the origin with the distance r travelled by the random walker. Both approaches yield the same dimension. For networks with δ < de, d is infinity, while for δ > 2de, d obtains the value of the embedding dimension de. In the intermediate regime of interest de ≤ δ < 2 de, our numerical results suggest that d decreases continously from d = ∞ to de, with d - de (δ - de)-1 for δ close to de. Finally, we discuss the scaling of the mass M and the Euclidean distance r with the topological distance . Our results suggest that in the intermediate regime de ≤ δ < 2 de, M() and r() do not increase with as a power law but with a stretched exponential, M() [A δ' (2 - δ')] and r() [B δ' (2 - δ')], where δ' = δ/de. The parameters A and B are related to d by d = A/B, such that M() r()d. For δ < de, M increases exponentially with , as known for δ=0, while r is constant and independent of . For δ ≥ 2de, we find power law scaling, M() d and r() 1/dmin, with d · dmin = d.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…