Commutative monoid formalism for weighted coupled cell networks and invariant synchrony patterns

DOI10.1137/20M1387109MaRDI QIDQ5158632zbMATH OpenOpenAlexFDO

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

Publication date 25 October 2021

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

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

zbMATH Keywords

synchronybalanced partitionscoupled cell networks

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Symmetries, invariants of ordinary differential equations (34C14) Nonlinear oscillations and coupled oscillators for ordinary differential equations (34C15) Decentralized systems (93A14) Network design and communication in computer systems (68M10)

Abstract: This paper presents a framework based on matrices of monoids for the study of coupled cell networks. We formally prove within the proposed framework, that the set of results about invariant synchrony patterns for unweighted networks also holds for the weighted case. Moreover, the approach described allows us to reason about any multiedge and multiedge-type network as if it was single edge and single-edge-type. Several examples illustrate the concepts described. Additionally, an improvement of the coarsest invariant refinement algorithm to find balanced partitions is presented that exhibits a worst-case complexity of $mathbfO(vertmathcalCver{t}^3)$, where $mathcalC$ denotes the set of cells.

Recommendations

• Synchronization and equitable partitions in weighted networks
• The lattice of synchrony subspaces of a coupled cell network: characterization and computation algorithm
• Synchrony and antisynchrony in weighted networks
• Computation of balanced equivalence relations and their lattice for a coupled cell network
• Invariant synchrony and anti-synchrony subspaces of weighted networks

Cites work

• A POLYNOMIAL TIME ALGORITHM TO DETERMINE MAXIMAL BALANCED EQUIVALENCE RELATIONS
• Collective dynamics of `small-world' networks
• Complex networks: structure and dynamics
• Emergence of Scaling in Random Networks
• Invariant synchrony subspaces of sets of matrices
• Nonlinear dynamics of networks: the groupoid formalism
• Patterns of Synchrony in Coupled Cell Networks with Multiple Arrows
• Symmetry Groupoids and Patterns of Synchrony in Coupled Cell Networks
• Synchronization in complex networks of phase oscillators: a survey
• The Kuramoto model in complex networks
• The Structure and Function of Complex Networks
• The lattice of balanced equivalence relations of a coupled cell network

Cited in

(4)

• Synchrony and antisynchrony in weighted networks
• Decomposition of Admissible Functions in Weighted Coupled Cell Networks
• An in-reachability based classification of invariant synchrony patterns in weighted coupled cell networks
• Finite characterization of the coarsest balanced coloring of a network

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Commutative monoid formalism for weighted coupled cell networks and invariant synchrony patterns

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