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
The Chip Race Explained for People Who Don’t Care About Chips
0dev.to AI
The first prompt got me 80% of the way. The last 20% took the weekend.
0dev.to AI
8 AI Agent Development Services to Compare Before Building a Production Workflow
0dev.to AI
What AI marketing tools actually cost a solo founder (November 2026, with sources)
0dev.to AI
Tried AWS updates from KubeCon NA 2026 week: FSx for ONTAP S3 Access Points on Fargate, Nitro Sandbox, Security Groups for Pods
0dev.to AWS
12mins to 98s: How We Made AWS EBS Snapshot Restoration 7.5 Faster ?
0dev.to AWS