Coordinated and uncoordinated optimization of networks


Brede, Markus (2010) Coordinated and uncoordinated optimization of networks. Physical Review E, 81, (6), 066104-[10]. (doi:10.1103/PhysRevE.81.066104).

Download

[img]
Preview
PDF - Publishers print
Download (537Kb)

Description/Abstract

In this paper, we consider spatial networks that realize a balance between an infrastructure cost (the cost of wire needed to connect the network in space) and communication efficiency, measured by average shortest path length. A global optimization procedure yields network topologies in which this balance is optimized. These are compared with network topologies generated by a competitive process in which each node strives to optimize its own cost-communication balance. Three phases are observed in globally optimal configurations for different cost-communication trade offs: (i) regular small worlds, (ii) starlike networks, and (iii) trees with a center of interconnected hubs. In the latter regime, i.e., for very expensive wire, power laws in the link length distributions P(w)∝w−α are found, which can be explained by a hierarchical organization of the networks. In contrast, in the local optimization process the presence of sharp transitions between different network regimes depends on the dimension of the underlying space. Whereas for d=∞ sharp transitions between fully connected networks, regular small worlds, and highly cliquish periphery-core networks are found, for d=1 sharp transitions are absent and the power law behavior in the link length distribution persists over a much wider range of link cost parameters. The measured power law exponents are in agreement with the hypothesis that the locally optimized networks consist of multiple overlapping suboptimal hierarchical trees

Item Type: Article
ISSNs: 1539-3755 (print)
1550-2376 (electronic)
Subjects: Q Science > QC Physics
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Agents, Interactions & Complexity
ePrint ID: 196641
Date Deposited: 09 Sep 2011 13:30
Last Modified: 27 Mar 2014 19:45
Further Information:Google Scholar
ISI Citation Count:4
URI: http://eprints.soton.ac.uk/id/eprint/196641

Actions (login required)

View Item View Item