Grasping the connectivity of random functional graphs

DOI10.1556/SSCMATH.42.2005.1.1zbMath1080.05054OpenAlexW2128686816MaRDI QIDQ5313918

No author found.

Publication date: 26 January 2006

Published in: Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1556/sscmath.42.2005.1.1

zbMATH Keywords

complex dynamical systems

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (5)

Phase transition in \textit{NK}-Kauffman networks and its correction for Boolean irreducibility ⋮ 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 ⋮ Decomposition and factorisation of transients in functional graphs ⋮ Canalization and the stability of \(NK\)-Kauffman networks

This page was built for publication: Grasping the connectivity of random functional graphs