We review the analysis of the length of the optimal path ℓopt in random networks with disorder (i.e., random weights on the links). In the case of strong disorder, in which the maximal weight along the path dominates the sum, we find that ℓopt increases dramatically compared to the known...

We use the generating function formalism to calculate the fractal dimensions for the percolating cluster at criticality in Erdős–Rényi (ER) and random scale free (SF) networks, with degree distribution P(k)=ck−λ. We show that the chemical dimension is dl=2 for ER and SF networks with...

We study the transition between the strong and weak disorder regimes in the scaling properties of the average optimal path ℓopt in a disordered Erdős–Rényi (ER) random network and scale-free (SF) network. Each link i is associated with a weight τi≡exp(ari), where ri is a random number...

A method for embedding graphs in Euclidean space is suggested. The method connects nodes to their geographically closest neighbors and economizes on the total physical length of links. The topological and geometrical properties of scale-free networks embedded by the suggested algorithm are...