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

DOI10.1063/1.3116166MaRDI QIDQ3008993zbMATH OpenOpenAlexFDO

Authors 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) General biology and biomathematics (92B05) Boolean functions (06E30)

Abstract: NK-Kauffman networks {cal L}^N_K are a subset of the Boolean functions on N Boolean variables to themselves, Lambda_N = {xi: IZ_2^N o IZ_2^N}. To each NK-Kauffman network it is possible to assign a unique Boolean function on N variables through the function Psi: {cal L}^N_K o Lambda_N. The probability {cal P}_K that Psi (f) = Psi (f'), when f' is obtained through f by a change of one of its K-Boolean functions (b_K: IZ_2^K o IZ_2), and/or connections; is calculated. The leading term of the asymptotic expansion of {cal P}_K, for N gg 1, turns out to depend on: the probability to extract the tautology and contradiction Boolean functions, and in the average value of the distribution of probability of the Boolean functions; the other terms decay as {cal O} (1 / N). In order to accomplish this, a classification of the Boolean functions in terms of what I have called their irreducible degree of connectivity is established. The mathematical findings are discussed in the biological context where, Psi is used to model the genotype-phenotype map.

Recommendations

• On the number of \(NK\)-Kauffman networks mapped into a functional graph
• Canalization and the stability of \(NK\)-Kauffman networks
• Number of different binary functions generated by NK-Kauffman networks and the emergence of genetic robustness
• Phase transition in \textit{NK}-Kauffman networks and its correction for Boolean irreducibility
• Dynamics of random Boolean networks

Cites work

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

Cited in

(6)

• Invariant cycles in the random mapping of \(N\) integers onto themselves. Comparison with Kauffman binary network
• Canalization and the stability of \(NK\)-Kauffman networks
• Phase transition in \textit{NK}-Kauffman networks and its correction for Boolean irreducibility
• \(\mathbb{Z}_2\)-algebras in the Boolean function irreducible decomposition
• Number of different binary functions generated by NK-Kauffman networks and the emergence of genetic robustness
• On the number of \(NK\)-Kauffman networks mapped into a functional graph

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

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