Stability of functions in Boolean models of gene regulatory networks

Boolean networks are used to model large nonlinear systems such as gene regulatory networks. We will present results that can be used to understand how the choice of functions affects the network dynamics. The so called bias-map and its fixed points depict much of the function's dynamical role in the network. We define the concept of stabilizing functions and show that many Post and canalizing functions are also stabilizing functions. Boolean networks constructed using the same type of stabilizing functions are always stable regardless of the average in-degree of network functions. We derive the number of all stabilizing functions and find it to be much larger than the number of Post and canalizing functions. We also discuss the implementation of functions and apply the presented results to biological data that give an approximation of the distribution of regulatory functions in eucaryotic cells. We find that the obtained theoretical results on the number of active genes are biologically plausible. Finally, based on the presented results, we discuss why canalizing and Post regulatory functions seem to be common in cells.