Backend
On the Minimal Controllability of Boolean Networks With $k$-Regular Dependency Graphs
arXiv cs.SY0 views
arXiv:2611.08101v1 Announce Type: new Abstract: Boolean networks (BNs) are widely used to model gene regulatory networks and other biological systems. In this paper, we investigate the minimal controllability problem for BNs subject to degree constraints. We first establish three new best-case upper bounds for XOR-BNs whose dependency graphs are $k$-regular. We then introduce classes of BNs that are invariant under cyclically partite transformation (CPT-invariant) and prove theorems connecting BN controllability with the surjectivity of vector-valued Boolean functions. Finally, by combining an analysis of this surjectivity with a probabilistic argument, we derive a new general lower bound on the minimum number of control nodes required for majority-type threshold BNs with $(2k+1)$-regular dependency graphs.
Source：https://arxiv.org/abs/2611.08101PreviousTypes of Bursting with a Two-Block Spiking PrimitiveNextA Hybrid UKF with Explicit Drivetrain Modeling for Low-Velocity State Estimation of Electric Vehicles
Related posts
Agentjacking: A Fake Sentry Error Became a 'Fix' That Claude Code and Cursor Ran
0dev.to
How osFoundry detects that Claude Code is waiting on a permission prompt
0dev.to
A staging task that reached production started with a token in the wrong file
0dev.to
Export the records inside your JSON, then read the CSV back
0dev.to Data
Where can a small AI tool still win?
0dev.to Data
Only two songs charted on 6 platforms this week
0dev.to Data