Random Boolean Network
From CasGroup
| Line 24: | Line 24: | ||
* [http://www-users.cs.york.ac.uk/susan/cyc/n/nk.htm Applet for NK networks] | * [http://www-users.cs.york.ac.uk/susan/cyc/n/nk.htm Applet for NK networks] | ||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
== Links == | == Links == | ||
| Line 54: | Line 42: | ||
* Wikipedia page for [http://en.wikipedia.org/wiki/Boolean_network Boolean Network] | * Wikipedia page for [http://en.wikipedia.org/wiki/Boolean_network Boolean Network] | ||
| + | |||
| + | |||
| + | == Examples == | ||
| + | |||
| + | The Finite State Machine (FSM) for the whole boolean network reveals | ||
| + | the attractor structures and the basins of attraction. The | ||
| + | attractor - if one exists - is a fixed point or a discrete | ||
| + | limit cycle. The limit cycle is of course shorter than the | ||
| + | total number of states, which is 2^N for N nodes (2^3=8 for | ||
| + | 3 nodes). | ||
| + | |||
| + | [[Image:RBNExample1.png|left|RBN Examples]] | ||
| + | |||
| + | [[Image:RBNExample2.png|left|RBN Examples]] | ||
