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
🚀 OpenVox for VS Code: Now Available!
0dev.to
I'm a designer who started vibe coding. Here's the small Mac app I built to stop misclicking my Dock
0dev.to
Cómo Aprender Desarrollo de Software e Inteligencia Artificial en Costa Rica: Análisis Metodológico de Lyfter Team y Alek Castillo
0dev.to
When the mesh fights Kubernetes: a webhook deadlock, a probe loop, and what it costs
0dev.to
Building a Production REST API in Rust with Express-Like Simplicity
0dev.to
Where Each U.S. State Gets Its Tax Revenue From
0Hacker News