Phase transition in \textit{NK}-Kauffman networks and its correction for Boolean irreducibility

DOI10.1016/J.PHYSD.2014.02.006MaRDI QIDQ2630997zbMATH OpenOpenAlexFDO

Authors Federico Zertuche

Publication date 28 July 2016

Published in Physica D (Search for Journal in Brave)

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

zbMATH Keywords

\textit{NK}-Kauffman networksbinary functionsBoolean irreducibilitycellular automataphase transitions

Mathematics Subject Classification ID

Symbolic dynamics (37B10) Simulation of dynamical systems (37M05)

Abstract: In a series of articles published in 1986 Derrida, and his colleagues studied two mean field treatments (the quenched and the annealed) for extit{NK}-Kauffman Networks. Their main results lead to a phase transition curve $K_c,2,p_{c}left(1-p_{c}ight)=1$ ($0<p_c<1$) for the critical average connectivity $K_c$ in terms of the bias $p_c$ of extracting a "$1$" for the output of the automata. Values of $K$ bigger than $K_c$ correspond to the so-called chaotic phase; while $K<K_c$, to an ordered phase. In~[F. Zertuche, {it On the robustness of NK-Kauffman networks against changes in their connections and Boolean functions}. J.~Math.~Phys. {�f 50} (2009) 043513], a new classification for the Boolean functions, called {it Boolean irreducibility} permitted the study of new phenomena of extit{NK}-Kauffman Networks. In the present work we study, once again the mean field treatment for extit{NK}-Kauffman Networks, correcting it for {it Boolean irreducibility}. A shifted phase transition curve is found. In particular, for $p_c=1/2$ the predicted value $K_c=2$ by Derrida {it et al.} changes to $K_c=2.62140224613dots$ We support our results with numerical simulations.

Recommendations

• Canalization and the stability of \(NK\)-Kauffman networks
• On the robustness of NK-Kauffman networks against changes in their connections and Boolean functions
• On the number of NK-Kauffman networks mapped into a functional graph
• Phase transitions and antichaos in generalized Kauffman networks
• Boolean dynamics with random couplings

Cites work

• \(\mathbb{Z}_2\)-algebras in the Boolean function irreducible decomposition
• Boolean dynamics with random couplings
• Exact solution of Kauffman's model with connectivity one
• Grasping the connectivity of random functional graphs
• scientific article; zbMATH DE number 3884009 (Why is no real title available?)
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 3443655 (Why is no real title available?)
• scientific article; zbMATH DE number 274379 (Why is no real title available?)
• Number of different binary functions generated by NK-Kauffman networks and the emergence of genetic robustness
• On the robustness of NK-Kauffman networks against changes in their connections and Boolean functions

Cited in

(8)

• Phase transitions and antichaos in generalized Kauffman networks
• Canalization and the stability of \(NK\)-Kauffman networks
• \(\mathbb{Z}_2\)-algebras in the Boolean function irreducible decomposition
• On the robustness of NK-Kauffman networks against changes in their connections and Boolean functions
• Number of different binary functions generated by NK-Kauffman networks and the emergence of genetic robustness
• Exact solution of Kauffman's model with connectivity one
• On the number of NK-Kauffman networks mapped into a functional graph
• Boolean dynamics with random couplings

This page was built for publication: Phase transition in \textit{NK}-Kauffman networks and its correction for Boolean irreducibility

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