Z₂-algebras in the Boolean function irreducible decomposition
From MaRDI portal
Publication:2861702
Abstract: We develop further the consequences of the irreducible-Boolean classification established in Ref. [9]; which have the advantage of allowing strong statistical calculations in disordered Boolean function models, such as the extit{NK}-Kauffman networks. We construct a ring-isomorphism of the set of reducible -Boolean functions that are reducible in the Boolean arguments with indexes ; and the double power set , of the first natural numbers. This allows us, among other things, to calculate the number of -Boolean functions which are -irreducible with weight . is a fundamental quantity in the study of the stability of extit{NK}-Kauffman networks against changes in their connections between their Boolean functions; as well as in the mean field study of their dynamics when Boolean irreducibility is taken into account.
Recommendations
- On the robustness of NK-Kauffman networks against changes in their connections and Boolean functions
- Canalization and the stability of \(NK\)-Kauffman networks
- Phase transition in \textit{NK}-Kauffman networks and its correction for Boolean irreducibility
- On the number of NK-Kauffman networks mapped into a functional graph
- How many Boolean polynomials are irreducible?
Cites work
- Exact solution of Kauffman's model with connectivity one
- 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
- Probability Distributions Related to Random Mappings
Cited in
(3)
This page was built for publication: \(\mathbb{Z}_2\)-algebras in the Boolean function irreducible decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2861702)