Random Boolean Network

From CasGroup

Jump to: navigation, search
m (Reverted edits by Eboxytezi (Talk) to last version by Jfromm)
Line 23: Line 23:
* [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]
 +
 +
== 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]]
== Links ==
== Links ==
Line 38: Line 51:
* [http://arxiv.org/abs/nlin/0204062 Boolean Dynamics with Random Couplings] from Leo Kadanoff et al.
* [http://arxiv.org/abs/nlin/0204062 Boolean Dynamics with Random Couplings] from Leo Kadanoff et al.
-
== Examples ==
+
Wikipedia Pages
-
The Finite State Machine (FSM) for the whole boolean network reveals
+
* Wikipedia page for [http://en.wikipedia.org/wiki/Boolean_network Boolean Network]
-
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]]
+

Revision as of 17:29, 26 February 2011

Personal tools