Abstract
Random Boolean networks have striking properties of self-organization. In this paper we propose an algorithm based on the different roles of Boolean mappings and on the connection structure to analyze the organization of the network. For a few cases- transfer mappings, AND/OR, equivalence/XOR-rigorous results are obtained about the dynamics of homogeneous networks. Conclusions are then drawn concerning the non-homogeneous networks.
| Original language | English |
|---|---|
| Pages (from-to) | 715-730 |
| Number of pages | 16 |
| Journal | Bulletin of Mathematical Biology |
| Volume | 44 |
| Issue number | 5 |
| DOIs | |
| State | Published - Sep 1982 |
| Externally published | Yes |