Cluster synchronization on hypergraphs
Abstract
Full synchronization of dynamical elements coupled via hypergraphs can be analyzed with the hypergraph projection onto dyadic matrices, but this is not sufficient for analyzing cluster synchronization. Here we develop the necessary formalism. We introduce the notion of edge clusters and show how node and edge partitions allow us to verify admissible states and simplify their linear stability calculations. This provides a principled way to track dynamics on hypergraphs, and the projected Laplacian matrices based on each edge cluster are essential to linear stability analysis and its dimensionality reduction. This work goes beyond full synchronization and beyond dyadic interactions.
Keywords
Cite
@article{arxiv.2101.05464,
title = {Cluster synchronization on hypergraphs},
author = {Anastasiya Salova and Raissa M. D'Souza},
journal= {arXiv preprint arXiv:2101.05464},
year = {2022}
}
Comments
11 pages, 5 figures; updated content, figures, and references