Invariant and Dual Invariant Subspaces of $k$-valued Networks
Consider a $k$-valued network. Two kinds of (control) invariant subspaces, called state and dual invariant subspaces, are proposed, which are subspaces of state space and dual space respectively. Algorithms are presented to verify whether a dual subspace is a dual or dual control invariant subspace. The bearing space of $k$-valued (control) networks is introduced. Using the structure of bearing space, the universal invariant subspace is introduced, which is independent of the dynamics of particular networks. Finally, the relationship between state invariant subspace and dual invariant subspace of a network is investigated. A duality property shows that if a dual subspace is invariant then its perpendicular state subspace is also invariant and vice versa.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Structures of M-Invariant Dual Subspaces with Respect to a Boolean Network
This paper presents the following research findings on Boolean networks (BNs) and their dual subspaces.First, we establish a bijection between the dual subspaces of a BN and the partitions of its state set. Furthermore, …
Hypothesis testing on invariant subspaces of non-symmetric matrices with applications to network statistics
We extend the inference procedure for eigenvectors of Tyler (1981), which assumes symmetrizable matrices to generic invariant and singular subspaces of non-diagonalisable matrices to test whether $\nu \in \mathbb{R}^{p \…
Group-Invariant Subspace Clustering
In this paper we consider the problem of group invariant subspace clustering where the data is assumed to come from a union of group-invariant subspaces of a vector space, i.e. subspaces which are invariant with respect …
ClusteringData-driven Meets Geometric Control: Zero Dynamics, Subspace Stabilization, and Malicious Attacks
Studying structural properties of linear dynamical systems through invariant subspaces is one of the key contributions of the geometric approach to system theory. In general, a model of the dynamics is required in order …
Approximate Grassmannian Intersections: Subspace-Valued Subspace Learning
Subspace learning is one of the most foundational tasks in computer vision with applications ranging from dimensionality reduction to data denoising. As geometric objects, subspaces have also been successfully used for e…
DenoisingDimensionality ReductionTransfer Learning