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
Stochastic Derivative Estimation for Discontinuous Sample Performances: A Leibniz Integration Perspective
0arXiv stat.CO
Efficiently Estimating Cycle Statistics on Graphs via Spanning Trees
0arXiv stat.CO
I Audited 26 Episodes of a 59,000-Episode Open Robot Dataset. The Data Is Fine — the Metadata Isn't.
0dev.to Data
Is Google Maps accurate for closed businesses? We checked 400 places
0dev.to Data
WARN Act and Your FSA: What Happens to Your Flexible Spending Account After a Layoff
0dev.to News
The Week of November 27: 5,991 Workers, a Thanksgiving-Week Layoff Wave
0dev.to News