Papers › Invariant Synchrony and Anti-Synchrony Subspaces of Weighted Networks
Invariant Synchrony and Anti-Synchrony Subspaces of Weighted Networks
Eddie Nijholt, Nándor Sieben, James W. Swift
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.
The internal state of a cell in a coupled cell network is often described by an element of a vector space. Synchrony or anti-synchrony occurs when some of the cells are in the same or the opposite state. Subspaces of the state space containing cells in synchrony or anti-synchrony are called polydiagonal subspaces. We study the properties of several types of polydiagonal subspaces of weighted coupled cell networks. In particular, we count the number of such subspaces and study when they are dynamically invariant. Of special interest are the evenly tagged anti-synchrony subspaces in which the number of cells in a certain state is equal to the number of cells in the opposite state. Our main theorem shows that the dynamically invariant polydiagonal subspaces determined by certain types of couplings are either synchrony subspaces or evenly tagged anti-synchrony subspaces. A special case of this result confirms a conjecture about difference-coupled graph network systems.
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