2021/08/31 by Shirin Panahi, Nelson Amaya, Isaac Klickstein +2
Physics and Astronomy · Computer Science · Engineering · #cond-mat.dis-nn #cs.SY #eess.SY
paper · pdf · doi:10.1103/physreve.105.014313
Accepted for publication in PRE
arxiv created 2022/01/24 · arxiv updated 2022/02/02
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.