Failure of the simultaneous block diagonalization technique applied to complete and cluster synchronization of random networks
arXiv:2108.07893 · doi:10.1103/PhysRevE.105.014313
Abstract
We discuss here the application of the simultaneous block diagonalization (SBD) of matrices to the study of the stability of both complete and cluster synchronization in random (generic) networks. For both problems, we define indices that measure success (or failure) of application of the SBD technique in decoupling the stability problem into problems of lower dimensionality. We then see that in the case of random networks the extent of the dimensionality reduction achievable is the same as that produced by application of a trivial transformation.
Accepted for publication in PRE
References in corpus (6)
- Symmetry groups, semidefinite programs, and sums of squares
- Approximating the largest eigenvalue of network adjacency matrices
- Unified treatment of synchronization patterns in generalized networks with higher-order, multilayer, and temporal interactions
- Symmetry-independent stability analysis of synchronization patterns
- Symmetry Induced Group Consensus
- Cluster Synchronization of Networks via a Canonical Transformation for Simultaneous Block Diagonalization of Matrices