Beyond the binary case in random nets

DOI10.1007/BF02462073zbMath0547.94019OpenAlexW4246689658MaRDI QIDQ799652

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

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

Related Items (1)

Median attractor and transients in random boolean nets

Cites Work

• A behavioral summary for completely random nets
• Specific roles of the different Boolean mappings in random networks
• Analysis of the behaviour of Kauffman binary networks. II. The state cycle fraction for networks of different connectivities
• Cycles in logical nets
• Unnamed Item

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