Experiments in the dynamics of phase coupled oscillators when applied to graph colouring

Lee, S; Lister, R

Experiments in the dynamics of phase coupled oscillators when applied to graph colouring

Lee, S Lister, R

Permalink

Publication Type:: Conference Proceeding
Citation:: Conferences in Research and Practice in Information Technology Series, 2008, 74 pp. 83 - 89
Issue Date:: 2008-12-01

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download full textAdobe PDF (833.22 kB)

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Lee, S	en_US
dc.contributor.author	Lister, R https://orcid.org/0000-0001-5780-0445	en_US
dc.date.issued	2008-12-01	en_US
dc.identifier.citation	Conferences in Research and Practice in Information Technology Series, 2008, 74 pp. 83 - 89	en_US
dc.identifier.isbn	9781920682552	en_US
dc.identifier.issn	1445-1336	en_US
dc.identifier.uri	http://hdl.handle.net/10453/11386
dc.description.abstract	This paper examines the capacity of networks of phase coupled oscillators to coordinate activity in a parallel, distributed fashion. To benchmark these networks of oscillators, we present empirical results from a study of the capacity of such networks to colour graphs. We generalise the update equation of Aihara et al. (2006) to an equation that can be applied to graphs requiring multiple colours. We find that our simple multi-phase model can colour some types of graphs, especially complete graphs and complete k-partite graphs with equal or a near equal number of vertices in each partition. A surprising empirical result is that the effectiveness of the approach appears to be more dependent upon the topology of the graph than the size of the graph. Copyright © 2008, Australian Computer Society, Inc.	en_US
dc.relation.ispartof	Conferences in Research and Practice in Information Technology Series	en_US
dc.title	Experiments in the dynamics of phase coupled oscillators when applied to graph colouring	en_US
dc.type	Conference Proceeding
utslib.citation.volume	74	en_US
utslib.for	0806 Information Systems	en_US
dc.location.activity	Wollongong, Australia	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	/University of Technology Sydney/Strength - HCTD - Human Centred Technology Design
utslib.copyright.status	open_access
pubs.publication-status	Published	en_US
pubs.volume	74	en_US

Abstract:

This paper examines the capacity of networks of phase coupled oscillators to coordinate activity in a parallel, distributed fashion. To benchmark these networks of oscillators, we present empirical results from a study of the capacity of such networks to colour graphs. We generalise the update equation of Aihara et al. (2006) to an equation that can be applied to graphs requiring multiple colours. We find that our simple multi-phase model can colour some types of graphs, especially complete graphs and complete k-partite graphs with equal or a near equal number of vertices in each partition. A surprising empirical result is that the effectiveness of the approach appears to be more dependent upon the topology of the graph than the size of the graph. Copyright © 2008, Australian Computer Society, Inc.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/11386