On the robustness of NK-Kauffman networks against changes in their connections and Boolean functions

DOI10.1063/1.3116166zbMath1215.94098arXiv0903.4161OpenAlexW2054248606MaRDI QIDQ3008993

Federico Zertuche

Publication date: 23 June 2011

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

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

zbMATH Keywords

binary functionsCellular automatafunctional graphsgenetic robustnessirreducible connectivityredundant genetic material

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Boolean functions (06E30) General biology and biomathematics (92B05)

Related Items (3)

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

Cites Work

• Number of different binary functions generated by NK-Kauffman networks and the emergence of genetic robustness
• Grasping the connectivity of random functional graphs

This page was built for publication: On the robustness of NK-Kauffman networks against changes in their connections and Boolean functions