PreprintarXiv licencearXiv
Permutation order governs basin entropy in critical one-input Boolean networks
Abstract
Basin entropy measures uncertainty about a network's long-term behavior. For every critical one-input synchronous Boolean network with m relevant nodes, we show that the permutation structure induced by its feedback loops determines basin entropy, up to a universal error. Although the loops oscillate independently, their relative phases can be offset, producing a deviation from additivity that can grow linearly in m. Yet at the ensemble level, a previously derived additive prediction is preserved through the first subleading term, with the discrepancy appearing at order ln mlnln m.
Related
- Permutation theory governs long-term dynamics of critical Boolean networks
- Hierarchical permutation entropy regression identifies decadal decline in the intrinsic predictability of butterfly populations
- Exploring the robustness of permutation entropy analysis to differentiate between closed-eyes and open-eyes resting states
- Reduced weighted permutation entropy in visual-temporal cortex and altered resting-state brain dynamics in Alzheimer’s disease
- BIRDNet: Mining and Encoding Boolean Implication Knowledge Graphs as Interpretable Deep Neural Networks
BibTeX
@misc{liu2026permutation,
title = {{Permutation order governs basin entropy in critical one-input Boolean networks}},
author = {Ruodan Liu and Ahana Ghosh and Sean Campbell and Venkata Sai Narayana Bavisetty and Matthew Wheeler and Claus Kadelka},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.08532},
eprint = {2611.08532},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.08532},
}
RIS
TY - UNPB
TI - Permutation order governs basin entropy in critical one-input Boolean networks
AU - Ruodan Liu
AU - Ahana Ghosh
AU - Sean Campbell
AU - Venkata Sai Narayana Bavisetty
AU - Matthew Wheeler
AU - Claus Kadelka
PY - 2026
DA - 2026/11/04
PB - arXiv
DO - 10.48550/arxiv.2611.08532
UR - https://arxiv.org/abs/2611.08532
AB - Basin entropy measures uncertainty about a network's long-term behavior. For every critical one-input synchronous Boolean network with m relevant nodes, we show that the permutation structure induced by its feedback loops determines basin entropy, up to a universal error. Although the loops oscillate independently, their relative phases can be offset, producing a deviation from additivity that can grow linearly in m. Yet at the ensemble level, a previously derived additive prediction is preserved through the first subleading term, with the discrepancy appearing at order ln mlnln m.
ER -