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, we demonstrate that a dual subspace is $M$-invariant if and only if the associated partition is equitable (i.e., for every two cells of the partition, every two states in the former have the same number of out-neighbors in the latter) for the BN's state-transition graph (STG). Here $M$ represents the structure matrix of the BN.Based on the equitable graphic representation, we provide, for the first time, a complete structural characterization of the smallest $M$-invariant dual subspaces generated by a set of Boolean functions. Given a set of output functions, we prove that a BN is observable if and only if the partition corresponding to the smallest $M$-invariant dual subspace generated by this set of functions is trivial (i.e., all partition cells are singletons). Building upon our structural characterization, we also present a method for constructing output functions that render the BN observable.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
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…
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 …
ClusteringHypothesis 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 \…
A Boolean Function-Theoretic Framework for Expressivity in GNNs with Applications to Fair Graph Mining
We propose a novel expressivity framework for Graph Neural Networks (GNNs) grounded in Boolean function theory, enabling a fine-grained analysis of their ability to capture complex subpopulation structures. We introduce …
Invariant Subspace Approach to Boolean (Control) Networks
A logical function can be used to characterizing a property of a state of Boolean network (BN), which is considered as an aggregation of states. To illustrate the dynamics of a set of logical functions, which characteriz…