Decomposition of Admissible Functions in Weighted Coupled Cell Networks

DOI10.1137/22M1471328MaRDI QIDQ6174014zbMATH OpenOpenAlexFDO

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

Publication date 13 July 2023

Published in SIAM Journal on Applied Dynamical Systems (Search for Journal in Brave)

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

zbMATH Keywords

admissibilitycoupled cell networksfunction decompositionStirling numbers

Mathematics Subject Classification ID

Bell and Stirling numbers (11B73) Deterministic network models in operations research (90B10)

Abstract: This work makes explicit the degrees of freedom involved in modeling the dynamics of a network, or some other first-order property of a network, such as a measurement function. In previous work, an admissible function in a network was constructed through the evaluation of what we called oracle components. These oracle components are defined through some minimal properties that they are expected to obey. This is a high-level description in the sense that it is not clear how one could design such an object. The goal is to obtain a low-level representation of these objects by unwrapping them into their degrees of freedom. To achieve this, we introduce two decompositions. The first one is the more intuitive one and allows us to define the important concept of coupling order. The second decomposition is built on top of the first one and is valid for the class of coupling components that have finite coupling order. Despite this requirement, we show that this is still a very useful tool for designing coupling components with infinite coupling orders, through a limit approach.

Recommendations

• Gradient systems on coupled cell networks
• The realisation of admissible graphs for coupled vector fields
• Characterization of fundamental networks
• Permissible symmetries of coupled cell networks
• Dynamical equivalence of networks of coupled dynamical systems. I: Asymmetric inputs

Cites work

• Chaos in generically coupled phase oscillator networks with nonpairwise interactions
• Commutative monoid formalism for weighted coupled cell networks and invariant synchrony patterns
• Hopf normal form with \(S_N\) symmetry and reduction to systems of nonlinearly coupled phase oscillators
• Networks beyond pairwise interactions: structure and dynamics
• Nonlinear dynamics of networks: the groupoid formalism
• On decompositions of multivariate functions
• Patterns of synchrony for feed-forward and auto-regulation feed-forward neural networks
• Patterns of Synchrony in Coupled Cell Networks with Multiple Arrows
• 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
• The \(r\)-Stirling numbers
• The Kuramoto model in complex networks

Cited in

(1)

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

This page was built for publication: Decomposition of Admissible Functions in Weighted Coupled Cell Networks

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