To use all functions of this page, please activate cookies in your browser.
my.bionity.com
With an accout for my.bionity.com you can always see everything at a glance – and you can configure your own website and individual newsletter.
 My watch list
 My saved searches
 My saved topics
 My newsletter
Boolean networkA Boolean network consists of a set of Boolean variables whose state is determined by other variables in the network. They are a particular case of discrete dynamical networks, where time and states are discrete, i.e. they have a bijection onto an integer series. Boolean and elementary cellular automata are particular cases of Boolean networks, where the state of a variable is determined by its spatial neighbors. Additional recommended knowledge
Classical modelThe first Boolean networks were proposed by Stuart A. Kauffman in 1969, as random models of genetic regulatory networks (Kauffman 1969, 1993). A Random Boolean network (RBN) is a system of N binarystate nodes (representing genes) with K inputs to each node representing regulatory mechanisms. The two states (on/off) represent respectively, the status of a gene being active or inactive. The variable K is typically held constant, but it can also be varied across all genes, making it a set of integers instead of a single integer. In the simplest case each gene is assigned, at random, K regulatory inputs from among the N genes, and one of the possible Boolean functions of K inputs. This gives a random sample of the possible ensembles of NK networks. The state of a network at any point in time is given by the current states of all N genes. Thus the state space of any such network is 2^{N}. Simulation of RBNs is done in discrete time steps. The state of a node at time t+1 is a function of the state of its input nodes and the boolean function associated with it. The behavior of specific RBNs and generalized classes of them has been the subject of much of Kauffman's (and others) research. Such models are also known as NK models, or Kauffman networks. AttractorsA Boolean network has 2^{N} possible states. Sooner or later it will reach a previously visited state, and thus, since the dynamics are deterministic, fall into an attractor.
DynamicsOrder, chaos, and the edge Topologies
Updating Schemes
Applications
References


This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Boolean_network". A list of authors is available in Wikipedia. 