Critical points for random Boolean networks
From MaRDI portal
Publication:701495
Abstract: A model of cellular metabolism due to S. Kauffman is analyzed. It consists of a network of Boolean gates randomly assembled according to a probability distribution. It is shown that the behavior of the network depends very critically on certain simple algebraic parameters of the distribution. In some cases, the analytic results support conclusions based on simulations of random Boolean networks, but in other cases, they do not.
Recommendations
Cites work
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 1168330 (Why is no real title available?)
- scientific article; zbMATH DE number 861650 (Why is no real title available?)
- A critical point for random graphs with a given degree sequence
- On the threshold of chaos in random boolean cellular automata
- Random Plane Networks
- Stability of vertices in random boolean cellular automata
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence
Cited in
(9)- Reconstruction of Kauffman networks applying trees
- Persistence of activity in threshold contact processes, an annealed approximation of random Boolean networks
- Antichaos in a class of random Boolean cellular automata
- The formation of the frozen core in critical Boolean networks
- Supercriticality of an annealed approximation of Boolean networks
- From topology to dynamics in biochemical networks
- Energy and criticality in random Boolean networks
- Stability of vertices in random boolean cellular automata
- Dynamics of random Boolean networks
This page was built for publication: Critical points for random Boolean networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q701495)