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
Cisco 350-401 ENCOR: The Exam That Tests Whether You Can Run an Enterprise Network, Not Just Configure One
0dev.to
Why Your WordPress Site Keeps Breaking After Updates
0dev.to
Nodejs Queue Handoff: Publish Durable Alerts So Offline Users Get Notified
0dev.to
SaaS Security Best Practices: Protecting Customer Data at Scale
0dev.to
S3 Select in 2026: Why New Accounts Get MethodNotAllowed, and What to Use Instead
0dev.to
Confluence Page Approval Workflow, Step by Step
0dev.to