# Cluster Synchronization of Networks via a Canonical Transformation for Simultaneous Block Diagonalization of Matrices

arXiv: https://arxiv.org/abs/2109.13792 · HTML: https://mlsanity.com/paper/2109.13792/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 28 Sep 2021.

## Built on by (most cited first, 1 of 1)

- [Identifying Systems with Symmetries using Equivariant Autoregressive Reservoir Computers](https://mlsanity.com/paper/2311.09511/) (2023)

## Abstract (arXiv)

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.