Upper bound for the stability of Boolean networks
Boolean networks, inspired by gene regulatory networks, were developed to understand the complex behaviors observed in biological systems, with network attractors corresponding to biological phenotypes or cell types. In this article, we present a proof for a conjecture by Williadsen, Triesch and Wiles about upper bounds for the stability of basins of attraction in Boolean networks. We further extend this result from a single basin of attraction to the entire network. Specifically, we demonstrate that the asymptotic upper bound for the robustness and the basin entropy of a Boolean network are negatively linearly related.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Oblivious Bounds on the Probability of Boolean Functions
This paper develops upper and lower bounds for the probability of Boolean functions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. We call this approach diss…
ManagementLearning circuits with few negations
Monotone Boolean functions, and the monotone Boolean circuits that compute them, have been intensively studied in complexity theory. In this paper we study the structure of Boolean functions in terms of the minimum numbe…
Learning TheoryNegationOn the Number of Control Nodes in Boolean Networks with Degree Constraints
This paper studies the minimum control node set problem for Boolean networks (BNs) with degree constraints. The main contribution is to derive the nontrivial lower and upper bounds on the size of the minimum control node…
NegationNear-tight closure bounds for Littlestone and threshold dimensions
We study closure properties for the Littlestone and threshold dimensions of binary hypothesis classes. Given classes $\mathcal{H}_1, \ldots, \mathcal{H}_k$ of Boolean functions with bounded Littlestone (respectively, thr…
On the weight and density bounds of polynomial threshold functions
In this report, we show that all n-variable Boolean function can be represented as polynomial threshold functions (PTF) with at most $0.75 \times 2^n$ non-zero integer coefficients and give an upper bound on the absolute…