Computation of Balanced Equivalence Relations and Their Lattice for a Coupled Cell Network
From MaRDI portal
Publication:2871331
DOI10.1137/100819795zbMath1281.65089arXiv1211.6334OpenAlexW3100746818MaRDI QIDQ2871331
Peter J. A. Cock, Hiroko Kamei
Publication date: 22 January 2014
Published in: SIAM Journal on Applied Dynamical Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.6334
Related Items (17)
Symmetry-driven network reconstruction through pseudobalanced coloring optimization ⋮ Invariant Synchrony Subspaces of Sets of Matrices ⋮ Rigid patterns of synchrony for equilibria and periodic cycles in network dynamics ⋮ Graph partitions and cluster synchronization in networks of oscillators ⋮ Bistability of patterns of synchrony in Kuramoto oscillators with inertia ⋮ Finite Characterization of the Coarsest Balanced Coloring of a Network ⋮ Symmetry-Independent Stability Analysis of Synchronization Patterns ⋮ Generating symmetric graphs ⋮ Feedforward networks: adaptation, feedback, and synchrony ⋮ Overdetermined constraints and rigid synchrony patterns for network equilibria ⋮ Predicting pattern formation in multilayer networks ⋮ Robustness of cluster synchronous patterns in small-world networks with inter-cluster co-competition balance ⋮ Regular synchrony lattices for product coupled cell networks ⋮ Characterization and Computation of Partial Synchronization Manifolds for Diffusive Delay-Coupled Systems ⋮ Synchrony and Antisynchrony for Difference-Coupled Vector Fields on Graph Network Systems ⋮ Special Jordan Subspaces and Synchrony Subspaces in Coupled Cell Networks ⋮ Reduced Lattices of Synchrony Subspaces and Their Indices
This page was built for publication: Computation of Balanced Equivalence Relations and Their Lattice for a Coupled Cell Network