Construction of lattices of balanced equivalence relations for regular homogeneous networks using lattice generators and lattice indices
DOI10.1142/S0218127409025067zbMATH Open1182.34053MaRDI QIDQ5305151FDOQ5305151
Authors: Hiroko Kamei
Publication date: 19 March 2010
Published in: International Journal of Bifurcation and Chaos in Applied Sciences and Engineering (Search for Journal in Brave)
Recommendations
- The lattice of balanced equivalence relations of a coupled cell network
- The existence and classification of synchrony-breaking bifurcations in regular homogeneous networks using lattice structures
- Computation of balanced equivalence relations and their lattice for a coupled cell network
- Reduced lattices of synchrony subspaces and their indices
- The lattice of synchrony subspaces of a coupled cell network: characterization and computation algorithm
Neural networks for/in biological studies, artificial life and related topics (92B20) Ordinary lattice differential equations (34A33) Nonlinear oscillations and coupled oscillators for ordinary differential equations (34C15) Synchronization of solutions to ordinary differential equations (34D06)
Cites Work
- Statistical mechanics of complex networks
- Complex networks: structure and dynamics
- Exploring complex networks
- Title not available (Why is that?)
- Graph-theoretic methods for the analysis of chemical and biochemical networks. I. Multistability and oscillations in ordinary differential equation models
- Bifurcation to heteroclinic cycles and sensitivity in three and four coupled phase oscillators
- Symmetry Groupoids and Patterns of Synchrony in Coupled Cell Networks
- Patterns of Synchrony in Coupled Cell Networks with Multiple Arrows
- The existence and classification of synchrony-breaking bifurcations in regular homogeneous networks using lattice structures
- Nonlinear dynamics of networks: the groupoid formalism
- Title not available (Why is that?)
- COMPLEX NETWORKS: TOPOLOGY, DYNAMICS AND SYNCHRONIZATION
- Synchronization in networks of nonlinear dynamical systems coupled via a directed graph
- The lattice of balanced equivalence relations of a coupled cell network
- A POLYNOMIAL TIME ALGORITHM TO DETERMINE MAXIMAL BALANCED EQUIVALENCE RELATIONS
- WHEN SYMMETRIZATION GUARANTEES SYNCHRONIZATION IN DIRECTED NETWORKS
- USING GRAPH CONCEPTS TO UNDERSTAND THE ORGANIZATION OF COMPLEX SYSTEMS
Cited In (11)
- Hypernetworks: Cluster Synchronization Is a Higher-Order Effect
- The lattice of balanced equivalence relations of a coupled cell network
- Networks with asymmetric inputs: lattice of synchrony subspaces
- Classification of 2-node excitatory-inhibitory networks
- Overdetermined constraints and rigid synchrony patterns for network equilibria
- Computation of balanced equivalence relations and their lattice for a coupled cell network
- Reduced lattices of synchrony subspaces and their indices
- The existence and classification of synchrony-breaking bifurcations in regular homogeneous networks using lattice structures
- The lattice of synchrony subspaces of a coupled cell network: characterization and computation algorithm
- Finite characterization of the coarsest balanced coloring of a network
- Special Jordan subspaces and synchrony subspaces in coupled cell networks
This page was built for publication: Construction of lattices of balanced equivalence relations for regular homogeneous networks using lattice generators and lattice indices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5305151)