Synchronization of pulse-coupled biological oscillators
SIAM Journal on Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Self-Organization in Biological Systems
Self-Organization in Biological Systems
Sync: The Emerging Science of Spontaneous Order
Sync: The Emerging Science of Spontaneous Order
Decentralized synchronization protocols with nearest neighbor communication
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Firefly-inspired sensor network synchronicity with realistic radio effects
Proceedings of the 3rd international conference on Embedded networked sensor systems
Average distance as a predictor of synchronisability in networks of coupled oscillators
ACSC '10 Proceedings of the Thirty-Third Australasian Conferenc on Computer Science - Volume 102
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
| Hi-index | 0.00 |
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.