Fixed points of Boolean networks with sparse connections

DOI10.1088/1742-5468/AE727CMaRDI QIDQ7313814zbMATH OpenFDO

Authors Stav Marcus, Ari M. Turner, Guy Bunin, Bernard Derrida

Publication date 13 August 2026

Published in Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1088/1742-5468/AE727C

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Cites work

• An order parameter for networks of automata
• Combinatorial enumeration of groups, graphs, and chemical compounds. Translated from the German by Dorothee Aeppli
• scientific article; zbMATH DE number 1273988 (Why is no real title available?)
• scientific article; zbMATH DE number 5174567 (Why is no real title available?)
• scientific article; zbMATH DE number 3401212 (Why is no real title available?)
• Maximum number of fixed points in regulatory Boolean networks
• Neural networks and physical systems with emergent collective computational abilities
• On the Lambert \(w\) function
• On the threshold of chaos in random boolean cellular automata
• Random graphs.
• Random tree recursions: Which fixed points correspond to tangible sets of trees?
• Relevant elements, magnetization and dynamical properties in Kauffman networks: A numerical study
• Sudden emergence of a giant k-core in a random graph
• Superpolynomial growth in the number of attractors in Kauffman networks
• The modular structure of Kauffman networks
• The probabilistic method. With an appendix on the life and work of Paul Erdős.

This page was built for publication: Fixed points of Boolean networks with sparse connections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7313814)