title: Properties of Boolean networks and methods for their tests.
abstract: : Transcriptional regulation networks are often modeled as Boolean networks. We discuss certain properties of Boolean functions (BFs), which are considered as important in such networks, namely, membership to the classes of unate or canalizing functions. Of further interest is the average sensitivity (AS) of functions. In this article, we discuss several algorithms to test the properties of interest. To test canalizing properties of functions, we apply spectral techniques, which can also be used to characterize the AS of functions as well as the influences of variables in unate BFs. Further, we provide and review upper and lower bounds on the AS of unate BFs based on the spectral representation. Finally, we apply these methods to a transcriptional regulation network of Escherichia coli, which controls central parts of the E. coli metabolism. We find that all functions are unate. Also the analysis of the AS of the network reveals an exceptional robustness against transient fluctuations of the binary variables.a.
authors: Institute of Communications Engineering, Ulm University, Albert-Einstein-Allee 43, 89081 Ulm, Germany. johannes.klotz@uni-ulm.de.
authors: Johannes Georg
authors: JG
authors: Klotz
authors: Ronny
authors: R
authors: Feuer
authors: Oliver
authors: O
authors: Sawodny
authors: Martin
authors: M
authors: Bossert
authors: Michael
authors: M
authors: Ederer
authors: Steffen
authors: S
authors: Schober