arXiv (All)
open access
Permutation theory governs long-term dynamics of critical Boolean networks
Boolean networks are widely used to model gene regulatory Attractors of Boolean networks model stable gene-expression patterns, yet deriving their properties from network structure remains an open problem. We solve this problem for critical $K=1$ networks by showing that their feedback loops induce
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Learning Algorithm for Threshold Boolean Networks with Prescribed Fixed Points#1034066
- Partisan voter model on complex networks: Dynamics of local ordering#1105074
- Statistical mechanics of support vector networks#230072
- Randomly Initialized Networks Can Learn from Peer-to-Peer Consensus#120532
- Monotonic Kolmogorov-Arnold Networks: A Theoretical and Empirical Study of Monotonicity as an Inductive Bias#282810
Record · ID 821473
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive