Boolean networks with reliable dynamics

Details Boolean networks with reliable dynamics Boolean networks with reliable dynamics

2009-05-06

arxiv.org/abs/0905.0925v1

Phys. Rev. E 80, 056102 (2009)

Physics

Biological Physics

11 Pages, 15 figures

Scientific paper

10.1103/PhysRevE.80.056102

We investigated the properties of Boolean networks that follow a given reliable trajectory in state space. A reliable trajectory is defined as a sequence of states which is independent of the order in which the nodes are updated. We explored numerically the topology, the update functions, and the state space structure of these networks, which we constructed using a minimum number of links and the simplest update functions. We found that the clustering coefficient is larger than in random networks, and that the probability distribution of three-node motifs is similar to that found in gene regulation networks. Among the update functions, only a subset of all possible functions occur, and they can be classified according to their probability. More homogeneous functions occur more often, leading to a dominance of canalyzing functions. Finally, we studied the entire state space of the networks. We observed that with increasing systems size, fixed points become more dominant, moving the networks close to the frozen phase.

Affiliated with

Also associated with

No associations

Rating

Boolean networks with reliable dynamics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Boolean networks with reliable dynamics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Boolean networks with reliable dynamics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-455083