Papers › Cluster synchronization on hypergraphs
Cluster synchronization on hypergraphs
Anastasiya Salova, Raissa M. D'Souza
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections