S S Manna and A Kabakçioglu 2003 J. Phys. A: Math. Gen. 36 L279 doi:10.1088/0305-4470/36/19/101
S S Manna1,2 and A Kabakçioglu1
Show affiliationsA Barabási–Albert scale-free network is constructed whose nodes are the Poisson distributed random points within a unit square and links are the straight line connections among the nodes. The cost function, which is the total wiring length associated with such a network defined on a two-dimensional plane, is optimized. The optimization process consists of random selection of a pair of links and rewiring them to reduce the total length of the pair but with the constraint that the degree as well as the out-degree and in-degree of each node are precisely maintained. The resulting optimized network has a small diameter as well as high clustering and the link-length distribution has a stretched exponential tail.
05.40.-a Fluctuation phenomena, random processes, noise, and Brownian motion
89.75.Hc Networks and genealogical trees
51M05 Euclidean geometries (general) and generalizations
60K37 Processes in random environments
65K10 Optimization and variational techniques (See also 49Mxx, 93B40)
Issue 19 (16 May 2003)
Received 12 February 2003
Published 29 April 2003
S S Manna and A Kabakçioglu 2003 J. Phys. A: Math. Gen. 36 L279
Jianfeng Feng et al 2003 J. Phys. A: Math. Gen. 36 7469
Werner Becker et al. 2004 ApJ 615 908
P R Barber et al 2003 J. Phys. D: Appl. Phys. 36 1729
D. K. Ojha et al. 2004 ApJ 608 797
S Havlin et al 1985 J. Phys. A: Math. Gen. 18 L719
Ni Jun et al 2001 Chinese Phys. Lett. 18 1504
T Nandi and B P Mohanty 2009 J. Phys. B: At. Mol. Opt. Phys. 42 225402
J.H.F. Severo et al 2009 Nucl. Fusion 49 115026
Yongquan Xue et al. 2006 ApJ 647 194