Graph partitions and cluster synchronization in networks of oscillators

Journal article

Synchronization over networks depends strongly on the structure of the coupling between the oscillators. When the coupling presents certain regularities, the dynamics can be coarse-grained into clusters by means of External Equitable Partitions of the network graph and their associated quotient graphs. We exploit this graph-theoretical concept to study the phenomenon of cluster synchronization, in which different groups of nodes converge to distinct behaviors. We derive conditions and properties of networks in which such clustered behavior emerges and show that the ensuing dynamics is the result of the localization of the eigenvectors of the associated graph Laplacians linked to the existence of invariant subspaces. The framework is applied to both linear and non-linear models, first for the standard case of networks with positive edges, before being generalized to the case of signed networks with both positive and negative interactions. We illustrate our results with examples of both signed and unsigned graphs for consensus dynamics and for partial synchronization of oscillator networks under the master stability function as well as Kuramoto oscillators.

Authors: Schaub, M; O'Clery, N; Billeh, Y; Delvenne, J; Lambiotte, R

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: AIP Publishing
• Journal: Chaos: An Interdisciplinary Journal of Nonlinear Science
• Volume: 26
• Issue: 9
• Pages: 094821
• Publication date: 2016-08-19
• Acceptance date: 2016-08-01
• DOI: 10.1063/1.4961065
• EISSN: 1089-7682
• ISSN: 1054-1500