Scale-free Network on Euclidean Space Optimized by Rewiring of Links

Abstract

A 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 a 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.

arXiv comment4 pages, 5 figures

References in corpus (6)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• Lethality and centrality in protein networks
• Robust Patterns in Food Web Structure
• Scale-free Networks on Lattices
• Universality of the off-equilibrium response function in the kinetic Ising chain

Cited by in corpus (7)

• Scale Invariance in Road Networks
• Two distinct transitions in spatially embedded multiplex networks
• Growing Scale-free Networks by a Mediation-Driven Attachment Rule
• Degree Distribution, Rank-size Distribution, and Leadership Persistence in Mediation-Driven Attachment Networks
• Growing networks under geographical constraints
• Scale-free network on a vertical plane
• Sandpile model on an optimized scale-free network on Euclidean space