Upper bound for the stability of Boolean networks
Molecular Networks
2025-11-25 v1 Cellular Automata and Lattice Gases
Biological Physics
Abstract
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.
Cite
@article{arxiv.2506.12310,
title = {Upper bound for the stability of Boolean networks},
author = {Venkata Sai Narayana Bavisetty and Matthew Wheeler and Reinhard Laubenbacher and Claus Kadelka},
journal= {arXiv preprint arXiv:2506.12310},
year = {2025}
}