The University of Southampton
University of Southampton Institutional Repository

Fitness landscape analysis and optimization of coupled oscillators

Fitness landscape analysis and optimization of coupled oscillators
Fitness landscape analysis and optimization of coupled oscillators
Synchronization in chaotic oscillatory systems has a wide array of applications in biology, physics, and communications systems. Over the past 10 years there has been considerable interest in the synchronization properties of small-world and scale-free networks. In this paper, we define the fitness of a configuration of coupled oscillators as its ability to synchronize, which is related to the ratio of the largest and smallest eigenvalues of the coupling matrix. After an analysis of the fitness landscape of the coupled oscillators problem, we employ an optimization algorithm to determine network structures that lead to an enhanced ability to synchronize. The optimized networks generally have low clustering, small diameters, short path-length, are disassortative, and have a high degree of homogeneity in their degree and load distributions
317-331
Newth, David
e4f6e8f6-b8cf-49c0-b3db-489c50143a8a
Brede, Markus
bbd03865-8e0b-4372-b9d7-cd549631f3f7
Newth, David
e4f6e8f6-b8cf-49c0-b3db-489c50143a8a
Brede, Markus
bbd03865-8e0b-4372-b9d7-cd549631f3f7

Newth, David and Brede, Markus (2006) Fitness landscape analysis and optimization of coupled oscillators. Complex Systems, 16 (4), 317-331.

Record type: Article

Abstract

Synchronization in chaotic oscillatory systems has a wide array of applications in biology, physics, and communications systems. Over the past 10 years there has been considerable interest in the synchronization properties of small-world and scale-free networks. In this paper, we define the fitness of a configuration of coupled oscillators as its ability to synchronize, which is related to the ratio of the largest and smallest eigenvalues of the coupling matrix. After an analysis of the fitness landscape of the coupled oscillators problem, we employ an optimization algorithm to determine network structures that lead to an enhanced ability to synchronize. The optimized networks generally have low clustering, small diameters, short path-length, are disassortative, and have a high degree of homogeneity in their degree and load distributions

Full text not available from this repository.

More information

Published date: 2006
Organisations: Agents, Interactions & Complexity

Identifiers

Local EPrints ID: 272888
URI: http://eprints.soton.ac.uk/id/eprint/272888
PURE UUID: 73987995-0c20-4060-8836-598869559bfa

Catalogue record

Date deposited: 29 Sep 2011 16:22
Last modified: 01 Jul 2020 16:32

Export record

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.

×