Cluster Synchronization of Networks via a Canonical Transformation for Simultaneous Block Diagonalization of Matrices
arXiv:2109.13792 · doi:10.1063/5.0071154
Abstract
We study cluster synchronization of networks and propose a canonical transformation for simultaneous block diagonalization of matrices that we use to analyze stability of the cluster synchronous solution. Our approach has several advantages as it allows us to: (1) decouple the stability problem into subproblems of minimal dimensionality while preserving physically meaningful information; (2) study stability of both orbital and equitable partitions of the network nodes and (3) obtain a parametrization of the problem in a small number of parameters. For the last point, we show how the canonical transformation decouples the problem into blocks that preserve key physical properties of the original system. We also apply our proposed algorithm to analyze several real networks of interest, and we find that it runs faster than alternative algorithms from the literature.
Accepted for publication in Chaos: An Interdisciplinary Journal of Nonlinear Science
References in corpus (10)
- Finding community structure in networks using the eigenvectors of matrices
- Remote synchronization reveals network symmetries and functional modules
- Network synchronization of groups
- Symmetries and Cluster Synchronization in Multilayer Networks
- Control of synchronization patterns in neural-like Boolean networks
- Nonlocal mechanism for cluster synchronization in neural circuits
- Symmetry-independent stability analysis of synchronization patterns
- One-way dependent clusters and stability of cluster synchronization in directed networks
- Symmetry Induced Group Consensus
- Modal Decomposition of the Linear Swing Equation in Networks with Symmetries