The University of Southampton
University of Southampton Institutional Repository

Coordinated and uncoordinated optimization of networks

Coordinated and uncoordinated optimization of networks
Coordinated and uncoordinated optimization of networks
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
1539-3755
066104-[10]
Brede, Markus
bbd03865-8e0b-4372-b9d7-cd549631f3f7
Brede, Markus
bbd03865-8e0b-4372-b9d7-cd549631f3f7

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

Record type: Article

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

Text
PRE81_066104.pdf - Version of Record
Download (550kB)

More information

Published date: June 2010
Organisations: Agents, Interactions & Complexity

Identifiers

Local EPrints ID: 196641
URI: http://eprints.soton.ac.uk/id/eprint/196641
ISSN: 1539-3755
PURE UUID: b0a98ac4-49bd-41bd-865b-da159e6aee86

Catalogue record

Date deposited: 09 Sep 2011 13:30
Last modified: 14 Mar 2024 04:08

Export record

Altmetrics

Contributors

Author: Markus Brede

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×