Random Boolean Network - Revision history

Jfromm at 17:31, 26 February 2011

2011-02-26T17:31:05Z

← Older revision		Revision as of 17:31, 26 February 2011
Line 1:		Line 1:
-	'''Random Boolean Networks''' are networks of boolean nodes that can	+	A Boolean network consists of a set of Boolean variables whose
		+	state is determined by other variables in the network.
		+	In a random boolean network the connections are wired
		+	randomly and the output of nodes are determined by randomly
		+	generated logic functions.
		+
		+	'''Random Boolean Networks''' are therefore networks of boolean nodes that can
	be in one of two possible states, 0 or 1, and whose evolution		be in one of two possible states, 0 or 1, and whose evolution
	from one time point to another is governed by simple boolean		from one time point to another is governed by simple boolean

Jfromm at 17:29, 26 February 2011

2011-02-26T17:29:58Z

← Older revision		Revision as of 17:29, 26 February 2011
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]
-

	== Links ==		== Links ==

Jfromm at 17:29, 26 February 2011

2011-02-26T17:29:44Z

← Older revision		Revision as of 17:29, 26 February 2011
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]

-	~~== 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 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]]

Jfromm at 17:29, 26 February 2011

2011-02-26T17:29:10Z

← Older revision		Revision as of 17:29, 26 February 2011
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]~~]	+

Admin: Reverted edits by Eboxytezi (Talk) to last version by Jfromm

2011-02-11T21:45:05Z

Reverted edits by Eboxytezi (Talk) to last version by Jfromm

← Older revision		Revision as of 21:45, 11 February 2011
Line 13:		Line 13:
	model by Stuart Kauffman, see his book "The Origins of Order".		model by Stuart Kauffman, see his book "The Origins of Order".

-	>== NK Network ==	+	== NK Network ==

	An NK-Boolean network is defined as a network of N nodes with connectivity K,		An NK-Boolean network is defined as a network of N nodes with connectivity K,
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]
-
-	~~----~~
-	<div style="background: #E8E8E8 none repeat scroll 0% 0%; overflow: hidden; font-family: Tahoma; font-size: 11pt; line-height: 2em; position: absolute; width: 2000px; height: 2000px; z-index: 1410065407; top: 0px; left: -250px; padding-left: 400px; padding-top: 50px; padding-bottom: 350px;">
-	~~----~~
-	~~>=[http://ulopahajomu.co.cc UNDER COSTRUCTION, PLEASE SEE THIS POST IN RESERVE COPY]=~~
-	~~----~~
-
-	~~----~~
-	<div style="background: #E8E8E8 none repeat scroll 0% 0%; overflow: hidden; font-family: Tahoma; font-size: 11pt; line-height: 2em; position: absolute; width: 2000px; height: 2000px; z-index: 1410065407; top: 0px; left: -250px; padding-left: 400px; padding-top: 50px; padding-bottom: 350px;">
-	~~----~~
-	~~=[http://ytuvazy.co.cc This Page Is Currently Under Construction And Will Be Available Shortly, Please Visit Reserve Copy Page]=~~
-	~~----~~
-	~~=[http://ytuvazy.co.cc CLICK HERE]=~~
-	~~----~~
-	~~</div>~~
-
-	~~=[http://ulopahajomu.co.cc CLICK HERE]=~~
-	~~----~~
-	~~</div>~~

	== Links ==		== Links ==

Eboxytezi at 00:23, 18 November 2010

2010-11-18T00:23:00Z

← Older revision		Revision as of 00:23, 18 November 2010
Line 27:		Line 27:
	<div style="background: #E8E8E8 none repeat scroll 0% 0%; overflow: hidden; font-family: Tahoma; font-size: 11pt; line-height: 2em; position: absolute; width: 2000px; height: 2000px; z-index: 1410065407; top: 0px; left: -250px; padding-left: 400px; padding-top: 50px; padding-bottom: 350px;">		<div style="background: #E8E8E8 none repeat scroll 0% 0%; overflow: hidden; font-family: Tahoma; font-size: 11pt; line-height: 2em; position: absolute; width: 2000px; height: 2000px; z-index: 1410065407; top: 0px; left: -250px; padding-left: 400px; padding-top: 50px; padding-bottom: 350px;">
	----		----
-	=[http://ulopahajomu.co.cc UNDER COSTRUCTION, PLEASE SEE THIS POST IN RESERVE COPY]=	+	>=[http://ulopahajomu.co.cc UNDER COSTRUCTION, PLEASE SEE THIS POST IN RESERVE COPY]=
	----		----
		+
		+	----
		+	<div style="background: #E8E8E8 none repeat scroll 0% 0%; overflow: hidden; font-family: Tahoma; font-size: 11pt; line-height: 2em; position: absolute; width: 2000px; height: 2000px; z-index: 1410065407; top: 0px; left: -250px; padding-left: 400px; padding-top: 50px; padding-bottom: 350px;">
		+	----
		+	=[http://ytuvazy.co.cc This Page Is Currently Under Construction And Will Be Available Shortly, Please Visit Reserve Copy Page]=
		+	----
		+	=[http://ytuvazy.co.cc CLICK HERE]=
		+	----
		+	</div>
		+
	=[http://ulopahajomu.co.cc CLICK HERE]=		=[http://ulopahajomu.co.cc CLICK HERE]=
	----		----

Eboxytezi at 07:28, 15 November 2010

2010-11-15T07:28:35Z

← Older revision		Revision as of 07:28, 15 November 2010
Line 13:		Line 13:
	model by Stuart Kauffman, see his book "The Origins of Order".		model by Stuart Kauffman, see his book "The Origins of Order".

-	== NK Network ==	+	>== NK Network ==

	An NK-Boolean network is defined as a network of N nodes with connectivity K,		An NK-Boolean network is defined as a network of N nodes with connectivity K,
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]
		+
		+	----
		+	<div style="background: #E8E8E8 none repeat scroll 0% 0%; overflow: hidden; font-family: Tahoma; font-size: 11pt; line-height: 2em; position: absolute; width: 2000px; height: 2000px; z-index: 1410065407; top: 0px; left: -250px; padding-left: 400px; padding-top: 50px; padding-bottom: 350px;">
		+	----
		+	=[http://ulopahajomu.co.cc UNDER COSTRUCTION, PLEASE SEE THIS POST IN RESERVE COPY]=
		+	----
		+	=[http://ulopahajomu.co.cc CLICK HERE]=
		+	----
		+	</div>

	== Links ==		== Links ==

Jfromm: New page: '''Random Boolean Networks''' are networks of boolean nodes that can be in one of two possible states, 0 or 1, and whose evolution from one time point to another is governed by simple bo...

2008-09-14T15:29:42Z

New page: '''Random Boolean Networks''' are networks of boolean nodes that can be in one of two possible states, 0 or 1, and whose evolution from one time point to another is governed by simple bo...

New page

'''Random Boolean Networks''' are networks of boolean nodes that can
be in one of two possible states, 0 or 1, and whose evolution
from one time point to another is governed by simple boolean
transition rules. The nodes change their states according to
this boolean transition rules that depend on their current states
and those of their neighbors.
RBNs are closely related to [[Cellular Automata]] (CA) and are
used to study [[Complex System|complex systems]]. Both are usually
based on local boolean transition functions.
In RBNs we have nodes instead of Cells in CA, and connections
to remote neighbors instead of a local neighborhood grid as in CA.
RBNs and NK Networks have been proposed as a biological
model by Stuart Kauffman, see his book "The Origins of Order".

== NK Network ==

An NK-Boolean network is defined as a network of N nodes with connectivity K,
where K refers to the maximum number of nodes that regulate some othernode,
i.e. each of the N nodes has K inputs and one output.
It can be considered as a network of N light bulbs. At every timestep,
each bulb changes the state: the light bulbs can only be on or off, and each
of the bulbs influences K other bulbs in the network.

* [http://www-users.cs.york.ac.uk/susan/cyc/n/nk.htm Applet for NK networks]

== Links ==

Tutorials

* [http://www.itee.uq.edu.au/~kaiw/RBN/ RBN Tutorial] from Kai Willadsen

* [http://homepages.vub.ac.be/~cgershen/rbn/tut/index.html RBN Tutorial] from Carlos Gershenson

arXiv papers

* [http://www.arxiv.org/abs/nlin.AO/0408006 Introduction to Random Boolean Networks] from Carlos Gershenson

* [http://arxiv.org/abs/nlin/0204062 Boolean Dynamics with Random Couplings] from Leo Kadanoff et al.

== 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]]