Random Boolean Networks
classification
❄️ cond-mat.stat-mech
cond-mat.dis-nn
keywords
networksbooleanpropertiesrandomanalyticalargumentsattractorattractors
read the original abstract
This review explains in a self-contained way the properties of random Boolean networks and their attractors, with a special focus on critical networks. Using small example networks, analytical calculations, phenomenological arguments, and problems to solve, the basic concepts are introduced and important results concerning phase diagrams, numbers of relevant nodes and attractor properties are derived.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.