Fig 1.
(color online) The iterative construction process from G1 to G2 for the case of M = 3.
G1 includes 4 initial nodes and 6 edges with unit weight; in G2, is a copy of G1 scaled by a factor ri(i = 1,2,3). The 3 external nodes of each replica to the root of the original G1 through edges of unitary weight.
Fig 2.
(color online) Classification of nodes in network G3 for the case of M = 3.
The filled circles, open circles, full square and triangles represent peripheral nodes, locally peripheral nodes, hub nodes and locally hub nodes, respectively. In G3, is a copy of G2 scaled by a factor ri(i = 1,2,3). The 9 external nodes of each replica to the root of the original G1 through edges of unitary weight.
Fig 3.
The comparisons of theoretical predictions and simulation results the renormalized average weighted shortest path of λk.
versus the iteration, where M = 3 and . Under Floyd algorithm, data points are obtained by simulating the network at generation k = 2,3,4,5, respectively.