Mathematics – Combinatorics
Scientific paper
2008-05-02
Mathematics
Combinatorics
Scientific paper
The relationship between the properties of a dynamical system and the structure of its defining equations has long been studied in many contexts. Here we study this problem for the class of conjunctive (resp. disjunctive) Boolean networks, that is, Boolean networks in which all Boolean functions are constructed with the AND (resp. OR) operator only. The main results of this paper describe network dynamics in terms of the structure of the network dependency graph (topology). For a given such network, all possible limit cycle lengths are computed and lower and upper bounds for the number of cycles of each length are given. In particular, the exact number of fixed points is obtained. The bounds are in terms of structural features of the dependency graph and its partially ordered set of strongly connected components. For networks with strongly connected dependency graph, the exact cycle structure is computed.
Jarrah Abdul Salam
Laubenbacher Reinhard
Veliz-Cuba Alan
No associations
LandOfFree
The Dynamics of Conjunctive and Disjunctive Boolean Networks 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 The Dynamics of Conjunctive and Disjunctive Boolean Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Dynamics of Conjunctive and Disjunctive Boolean Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-341694