📝 SummarXiv

Abstract

Boolean networks (BNs) are important models for gene regulatory networks and many other biological systems. In this paper, we study the minimal controllability problem of threshold and XOR BNs with degree constraints. Firstly, we derive lower-bound-related inequalities and some upper bounds for the number of control nodes of several classes of controllable majority-type threshold BNs. Secondly, we construct controllable majority-type BNs and BNs involving Boolean threshold functions with both positive and negative coefficients such that these BNs are associated with a small number of control nodes. Thirdly, we derive a linear-algebraic necessary and sufficient condition for the controllability of general XOR-BNs, whose update rules are based on the XOR logical operator, and construct polynomial-time algorithms for computing control-node sets and control signals for general XOR-BNs. Lastly, we use ring theory and linear algebra to establish a few best-case upper bounds for a type of degree-constrainted XOR-BNs called $k$-$k$-XOR-BNs. In particular, we show that for any positive integer $m \geq 2$ and any odd integer $k \in [3, 2^{m} - 1]$, there exists a $2^{m}$-node controllable $k$-$k$-XOR-BN with 1 control node. Our results offer theoretical insights into minimal interventions in networked systems such as gene regulatory networks.