Use this URL to cite or link to this record in EThOS: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.506063
Title: Winnerless competition in neural dynamics : cluster synchronisation of coupled oscillators
Author: Wordsworth, John
Awarding Body: University of Exeter
Current Institution: University of Exeter
Date of Award: 2009
Availability of Full Text:
Access through EThOS:
Access through Institution:
Abstract:
Systems of globally coupled phase oscillators can have robust attractors that are heteroclinic networks. Such a heteroclinic network is generated, where the phases cluster into three groups, within a specific regime of parameters when the phase oscillators are globally coupled using the function $g(\varphi) = -\sin(\varphi + \alpha) + r \sin(2\varphi + \beta)$. The resulting network switches between 30 partially synchronised states for a system of $N=5$ oscillators. Considering the states that are visited and the time spent at those states a spatio-temporal code can be generated for a given navigation around the network. We explore this phenomenon further by investigating the effect that noise has on the system, how this system can be used to generate a spatio-temporal code derived from specific inputs and how observation of a spatio-temporal code can be used to determine the inputs that were presented to the system to generate a given coding. We show that it is possible to find chaotic attractors for certain parameters and that it is possible to detail a genetic algorithm that can find the parameters required to generate a specific spatio-temporal code, even in the presence of noise. In closing we briefly explore the dynamics where $N>5$ and discuss this work in relation to winnerless competition.
Supervisor: Ashwin, Peter ; Townley, Stuart Sponsor: EPSRC
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID: uk.bl.ethos.506063  DOI: Not available
Keywords: nonlinear dynamical systems ; Coupled Phase Oscillators ; Spatiotemporal Phenomena ; Genetic Algorithms and Oscillator Dynamics
Share: