An in-reachability based classification of invariant synchrony patterns in weighted coupled cell networks

DOI10.1088/1361-6544/AD0D71MaRDI QIDQ6181841zbMATH OpenOpenAlexFDO

Authors Pedro M. N. Sequeira, J. P. Hespanha, A. Pedro Aguiar

Publication date 20 December 2023

Published in Nonlinearity (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2306.00725

zbMATH Keywords

synchronyconnectivitycoupled cell networks

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Connectivity (05C40)

Abstract: This paper presents an in-reachability based classification of invariant synchrony patterns in Coupled Cell Networks (CCNs). These patterns are encoded through partitions on the set of cells, whose subsets of synchronized cells are called colors. We study the influence of the structure of the network in the qualitative behavior of invariant synchrony sets, in particular, with respect to the different types of (cumulative) in-neighborhoods and the in-reachability sets. This motivates the proposed approach to classify the partitions into the categories of strong, rooted and weak, according to how their colors are related with respect to the connectivity structure of the network. Furthermore, we show how this classification system acts under the partition join ($vee$) operation, which gives us the synchrony pattern that corresponds to the intersection of synchrony sets.

Recommendations

• Commutative monoid formalism for weighted coupled cell networks and invariant synchrony patterns
• Invariant synchrony and anti-synchrony subspaces of weighted networks
• Symmetry Groupoids and Patterns of Synchrony in Coupled Cell Networks
• Rigid patterns of synchrony for equilibria and periodic cycles in network dynamics
• Synchrony and antisynchrony in weighted networks

Cites work

• scientific article; zbMATH DE number 3595177 (Why is no real title available?)
• scientific article; zbMATH DE number 1748069 (Why is no real title available?)
• A POLYNOMIAL TIME ALGORITHM TO DETERMINE MAXIMAL BALANCED EQUIVALENCE RELATIONS
• Commutative monoid formalism for weighted coupled cell networks and invariant synchrony patterns
• Decomposition of Admissible Functions in Weighted Coupled Cell Networks
• Depth-First Search and Linear Graph Algorithms
• Invariant synchrony subspaces of sets of matrices
• Nonlinear dynamics of networks: the groupoid formalism
• Patterns of Synchrony in Coupled Cell Networks with Multiple Arrows
• Patterns of synchrony for feed-forward and auto-regulation feed-forward neural networks
• Reduced lattices of synchrony subspaces and their indices
• Special Jordan subspaces and synchrony subspaces in coupled cell networks
• Symmetry Groupoids and Patterns of Synchrony in Coupled Cell Networks
• Synchronization and equitable partitions in weighted networks
• Synchronization in complex networks of phase oscillators: a survey
• Synchrony and antisynchrony in weighted networks
• The Kuramoto model in complex networks
• The lattice of balanced equivalence relations of a coupled cell network
• The lattice of synchrony subspaces of a coupled cell network: characterization and computation algorithm

This page was built for publication: An in-reachability based classification of invariant synchrony patterns in weighted coupled cell networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6181841)