Invariant synchrony subspaces of sets of matrices
From MaRDI portal
synchronyequitable partitioncoupled cell networkbalanced partitionsalmost equitable partitionsexo-balanced partitions
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Vector and tensor algebra, theory of invariants (15A72) Symmetries, invariants of ordinary differential equations (34C14)
Abstract: A synchrony subspace of R^n is defined by setting certain components of the vectors equal according to an equivalence relation. Synchrony subspaces invariant under a given set of square matrices form a lattice. Applications of these invariant synchrony subspaces include equitable and almost equitable partitions of the vertices of a graph used in many areas of graph theory, balanced and exo-balanced partitions of coupled cell networks, and coset partitions of Cayley graphs. We study the basic properties of invariant synchrony subspaces and provide many examples of the applications. We also present what we call the split and cir algorithm for finding the lattice of invariant synchrony subspaces. Our theory and algorithm is further generalized for non-square matrices. This leads to the notion of tactical decompositions studied for its application in design theory.
Recommendations
- The lattice of synchrony subspaces of a coupled cell network: characterization and computation algorithm
- Reduced lattices of synchrony subspaces and their indices
- Special Jordan subspaces and synchrony subspaces in coupled cell networks
- Invariant synchrony and anti-synchrony subspaces of weighted networks
- Computation of balanced equivalence relations and their lattice for a coupled cell network
Cites work
- scientific article; zbMATH DE number 428989 (Why is no real title available?)
- scientific article; zbMATH DE number 3823850 (Why is no real title available?)
- scientific article; zbMATH DE number 3983386 (Why is no real title available?)
- scientific article; zbMATH DE number 3751028 (Why is no real title available?)
- scientific article; zbMATH DE number 140043 (Why is no real title available?)
- scientific article; zbMATH DE number 524126 (Why is no real title available?)
- scientific article; zbMATH DE number 1890110 (Why is no real title available?)
- A POLYNOMIAL TIME ALGORITHM TO DETERMINE MAXIMAL BALANCED EQUIVALENCE RELATIONS
- A criterion for stability of cluster synchronization in networks with external equitable partitions
- AUTOMATED BIFURCATION ANALYSIS FOR NONLINEAR ELLIPTIC PARTIAL DIFFERENCE EQUATIONS ON GRAPHS
- Almost equitable partitions and new necessary conditions for network controllability
- Computation of balanced equivalence relations and their lattice for a coupled cell network
- Computing eigenfunctions on the Koch snowflake: a new grid and symmetry.
- Controllability of multi-agent systems from a graph-theoretic perspective
- Epidemic outbreaks in networks with equitable or almost-equitable partitions
- Graph partitions and cluster synchronization in networks of oscillators
- Interacting with Networks: How Does Structure Relate to Controllability in Single-Leader, Consensus Networks?
- Invariant synchrony subspaces of sets of matrices
- Laplacian eigenvectors and eigenvalues and almost equitable partitions
- Lattice Theory: Foundation
- Mesoscale and clusters of synchrony in networks of bursting neurons
- Newton's method and symmetry for semilinear elliptic PDE on the cube
- On multi-consensus and almost equitable graph partitions
- Patterns in square arrays of coupled cells
- Patterns of Synchrony in Coupled Cell Networks with Multiple Arrows
- Patterns of synchrony for feed-forward and auto-regulation feed-forward neural networks
- SYMMETRY AND SYNCHRONY IN COUPLED CELL NETWORKS 2: GROUP NETWORKS
- Spectra of generalized compositions of graphs and hierarchical networks
- Spectra of graphs obtained by a generalization of the join graph operation
- Symmetry Groupoids and Patterns of Synchrony in Coupled Cell Networks
- Symmetry and Automated Branch Following for a Semilinear Elliptic PDE on a Fractal Region
- Synchronization and equitable partitions in weighted networks
- Synchrony and antisynchrony for difference-coupled vector fields on graph network systems
- Tactical decompositions and orbits of projective groups
- The lattice of balanced equivalence relations of a coupled cell network
- The lattice of synchrony subspaces of a coupled cell network: characterization and computation algorithm
- Upper and Lower Bounds for Controllable Subspaces of Networks of Diffusively Coupled Agents
- Verallgemeinerungen von Transitivitätsklassen endlicher projektiver Ebenen
Cited in
(9)- A bifurcation lemma for invariant subspaces
- Invariant polydiagonal subspaces of matrices and constraint programming
- Invariant synchrony and anti-synchrony subspaces of weighted networks
- Reduced lattices of synchrony subspaces and their indices
- An in-reachability based classification of invariant synchrony patterns in weighted coupled cell networks
- The Synchronizing Probability Function for Primitive Sets of Matrices
- Invariant synchrony subspaces of sets of matrices
- Cluster dependency and synchronization of multilayer directed networks from a quotient graph perspective
- Commutative monoid formalism for weighted coupled cell networks and invariant synchrony patterns
This page was built for publication: Invariant synchrony subspaces of sets of matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5109373)
