A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Ordered dynamics in biased and cooperative Boolean networks
2013
Advances in Difference Equations
This paper contributes to the theoretical analysis of the qualitative behavior of two types of Boolean networks: biased and cooperative ones. A Boolean network is biased if at least a specified fraction of its regulatory functions returns one Boolean value more often than the other and is cooperative if there are no negative interactions between the variables. We prove nontrivial upper bounds on the maximum length of periodic orbits in such networks under the assumption that the maximum number
doi:10.1186/1687-1847-2013-313
fatcat:jjxya6zbsrh3pnt3hh6dzqteqm