Grasping the connectivity of random functional graphs

DOI10.1556/SSCMATH.42.2005.1.1MaRDI QIDQ5313918zbMATH OpenOpenAlexFDO

Authors

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

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

Recommendations

• On random mapping patterns
• On the connectivity of graphs generated by a sum of random mappings
• n-functionality of graphs
• On functional graphs of quadratic polynomials
• scientific article; zbMATH DE number 3168330

Cited in

(11)

• A limit theorem for the six-length of random functional graphs with a fixed degree sequence
• Canalization and the stability of \(NK\)-Kauffman networks
• Functional graphs
• Phase transition in \textit{NK}-Kauffman networks and its correction for Boolean irreducibility
• n-functionality of graphs
• n-functional digraphs uniquely determined by the skeleton
• 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
• On functional graphs of quadratic polynomials
• Graph functionality
• Decomposition and factorisation of transients in functional graphs

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

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