Complete characterization of the stability of cluster synchronization in complex dynamical networks

Synchronization is an important and prevalent phenomenon in natural and engineered systems. In many dynamical networks, the coupling is balanced or adjusted to admit global synchronization, a condition called Laplacian coupling. Many networks exhibit incomplete synchronization, where two or more clusters of synchronization persist, and computational group theory has recently proved to be valuable in discovering these cluster states based on the topology of the network. In the important case of Laplacian coupling, additional synchronization patterns can exist that would not be predicted from the group theory analysis alone. Understanding how and when clusters form, merge, and persist is essential for understanding collective dynamics, synchronization, and failure mechanisms of complex networks such as electric power grids, distributed control networks, and autonomous swarming vehicles. We describe a method to find and analyze all of the possible cluster synchronization patterns in a Laplacian-coupled network, by applying methods of computational group theory to dynamically equivalent networks. We present a general technique to evaluate the stability of each of the dynamically valid cluster synchronization patterns. Our results are validated in an optoelectronic experiment on a five-node network that confirms the synchronization patterns predicted by the theory.

FINITE LINEAR QUOTIENTS OF ${\mathcal{B}}_3$ OF LOW DIMENSION

We study the problem of deciding whether or not the image of an irreducible representation of the braid group [Formula: see text] of degree ≤ 5 has finite image if we are only given the eigenvalues of a generator. We provide a partial algorithm that determines when the images are finite or infinite in all but finitely many cases, and use these results to study examples coming from quantum groups. Our technique uses two classification theorems and the computational group theory package GAP.