Optimal synchronization in space
Optimal synchronization in space
In this Rapid Communication we investigate spatially constrained networks that realize optimal synchronization properties. After arguing that spatial constraints can be imposed by limiting the amount of “wire” available to connect nodes distributed in space, we use numerical optimization methods to construct networks that realize different trade offs between optimal synchronization and spatial constraints. Over a large range of parameters such optimal networks are found to have a link length distribution characterized by power-law tails P(l)?l??, with exponents ? increasing as the networks become more constrained in space. It is also shown that the optimal networks, which constitute a particular type of small world network, are characterized by the presence of nodes of distinctly larger than average degree around which long-distance links are centered.
025202-[4pp]
Brede, Markus
bbd03865-8e0b-4372-b9d7-cd549631f3f7
February 2010
Brede, Markus
bbd03865-8e0b-4372-b9d7-cd549631f3f7
Abstract
In this Rapid Communication we investigate spatially constrained networks that realize optimal synchronization properties. After arguing that spatial constraints can be imposed by limiting the amount of “wire” available to connect nodes distributed in space, we use numerical optimization methods to construct networks that realize different trade offs between optimal synchronization and spatial constraints. Over a large range of parameters such optimal networks are found to have a link length distribution characterized by power-law tails P(l)?l??, with exponents ? increasing as the networks become more constrained in space. It is also shown that the optimal networks, which constitute a particular type of small world network, are characterized by the presence of nodes of distinctly larger than average degree around which long-distance links are centered.
Text
PRE025202R.pdf
- Other
Restricted to Registered users only
Request a copy
More information
Published date: February 2010
Organisations:
Agents, Interactions & Complexity
Identifiers
Local EPrints ID: 272855
URI: http://eprints.soton.ac.uk/id/eprint/272855
ISSN: 1539-3755
PURE UUID: b3c6f481-8a29-4a11-9673-b38d20505c68
Catalogue record
Date deposited: 26 Sep 2011 16:15
Last modified: 14 Mar 2024 10:11
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