The realisation of admissible graphs for coupled vector fields

DOI10.1088/1361-6544/AD0CA4MaRDI QIDQ6181844zbMATH OpenFDO

Authors Tiago de Albuquerque Amorim, Miriam Manoel

Publication date 20 December 2023

Published in Nonlinearity (Search for Journal in Brave)

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

zbMATH Keywords

graphnetworksymmetrysynchronyadmissible vector field

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Neural networks for/in biological studies, artificial life and related topics (92B20) Inverse problems involving ordinary differential equations (34A55) Nonlinear oscillations and coupled oscillators for ordinary differential equations (34C15) Synchronization of solutions to ordinary differential equations (34D06)

Abstract: In a coupled network cells can interact in several ways. There is a vast literature from the last twenty years that investigates this interacting dynamics under a graph theory formalism, namely as a graph endowed with an input-equivalence relation on the set of vertices that enables a characterization of the admissible vector fields that rules the network dynamics. The present work goes in the direction of answering an inverse problem: for $ngeq2$, any mapping on $mathbb{R}^n$ can be realized as an admissible vector field for some graph with the number of vertices depending on (but not necessarily equal to) $n$. Given a mapping, we present a procedure to construct all non-equivalent admissible graphs, up to the appropriate equivalence relation. We also give an upper bound for the number of such graphs. As a consequence, invariant subspaces under the vector field can be investigated as the locus of synchrony states supported by an admissible graph, in the sense that a suitable graph can be chosen to realize couplings with more (or less) synchrony than another graph admissible to the same vector field. The approach provides in particular a systematic investigation of occurrence of chimera states in a network of van der Pol identical oscillators.

Recommendations

• Symmetry Groupoids and Admissible Vector Fields for Coupled Cell Networks
• Synchrony and antisynchrony for difference-coupled vector fields on graph network systems
• Gradient systems on coupled cell networks
• Symmetry Groupoids and Patterns of Synchrony in Coupled Cell Networks
• Permissible symmetries of coupled cell networks

Cites work

• scientific article; zbMATH DE number 2019919 (Why is no real title available?)
• CHIMERA STATES IN A RING OF NONLOCALLY COUPLED OSCILLATORS
• Chimera patterns in networks. Interplay between dynamics, structure, noise, and delay
• Chimera states: coexistence of coherence and incoherence in networks of coupled oscillators
• Coupled oscillators and the design of central pattern generators
• Linear equivalence and ODE-equivalence for coupled cell networks
• Patterns of Synchrony in Coupled Cell Networks with Multiple Arrows
• Phase Transitions and Other Phenomena in Chains of Coupled Oscillators
• SYMMETRY AND SYNCHRONY IN COUPLED CELL NETWORKS 1: FIXED-POINT SPACES
• Some curious phenomena in coupled cell networks
• Symmetry Groupoids and Patterns of Synchrony in Coupled Cell Networks
• Symmetry and phaselocking in chains of weakly coupled oscillators
• The Theory of Classical Dynamics
• The lattice of synchrony subspaces of a coupled cell network: characterization and computation algorithm
• The symmetry perspective. From equilibrium to chaos in phase space and physical space

Cited in

(2)

• Decomposition of Admissible Functions in Weighted Coupled Cell Networks
• Synchrony patterns in Laplacian networks

This page was built for publication: The realisation of admissible graphs for coupled vector fields

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