Number of different binary functions generated by NK-Kauffman networks and the emergence of genetic robustness

DOI10.1063/1.2768747zbMath1152.81592arXiv0708.2298OpenAlexW2095283699MaRDI QIDQ3544412

No author found.

Publication date: 8 December 2008

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0708.2298

Mathematics Subject Classification ID

Neural networks for/in biological studies, artificial life and related topics (92B20) Neural nets applied to problems in time-dependent statistical mechanics (82C32) Genetics and epigenetics (92D10)

Related Items (4)

Phase transition in \textit{NK}-Kauffman networks and its correction for Boolean irreducibility ⋮ On the robustness of NK-Kauffman networks against changes in their connections and Boolean functions ⋮ $\mathbb {Z}_2$ Z 2 -algebras in the Boolean function irreducible decomposition ⋮ Canalization and the stability of \(NK\)-Kauffman networks

Cites Work

• Exact solution of Kauffman's model with connectivity one
• The asymptotic number of attractors in the random map model
• Grasping the connectivity of random functional graphs
• Probability Distributions Related to Random Mappings

This page was built for publication: Number of different binary functions generated by NK-Kauffman networks and the emergence of genetic robustness