Beyond the binary case in random nets

DOI10.1007/BF02462073MaRDI QIDQ799652zbMATH OpenOpenAlexFDO

Authors Crayton C. Walker

Publication date 1984

Published in Bulletin of Mathematical Biology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02462073

zbMATH Keywords

behavioral cycle lengthshigh connectance netsmodular complexityrandom switching networks

Mathematics Subject Classification ID

Genetics and epigenetics (92D10) Random graphs (graph-theoretic aspects) (05C80) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Recommendations

• Median attractor and transients in random boolean nets
• Length of state cycles of random Boolean networks: an analytic study
• Invariant cycles in the random mapping of \(N\) integers onto themselves. Comparison with Kauffman binary network
• Dynamics of random Boolean networks
• ON THE PROPERTIES OF RANDOMLY CONNECTED McCULLOCH-PITTS NETWORKS: DIFFERENCES BETWEEN INPUT-CONSTANT AND INPUT-VARIANT NETWORKS

Cites work

• scientific article; zbMATH DE number 3320839 (Why is no real title available?)
• A behavioral summary for completely random nets
• Analysis of the behaviour of Kauffman binary networks. II. The state cycle fraction for networks of different connectivities
• Cycles in logical nets
• Specific roles of the different Boolean mappings in random networks

Cited in

(2)

• Median attractor and transients in random boolean nets
• On optimal random nets

This page was built for publication: Beyond the binary case in random nets

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