Bounds on the Average Sensitivity of Nested Canalizing Functions

Abstract

Nested canalizing Boolean (NCF) functions play an important role in biological motivated regulative networks and in signal processing, in particular describing stack filters. It has been conjectured that NCFs have a stabilizing effect on the network dynamics. It is well known that the average sensitivity plays a central role for the stability of (random) Boolean networks. Here we provide a tight upper bound on the average sensitivity for NCFs as a function of the number of relevant input variables. As conjectured in literature this bound is smaller than 4/3 This shows that a large number of functions appearing in biological networks belong to a class that has very low average sensitivity, which is even close to a tight lower bound.

revised submission to PLOS ONE

References in corpus (9)

• The Yeast Cell-Cycle Network Is Robustly Designed
• Random Boolean Network Models and the Yeast Transcriptional Network
• Boolean network model predicts cell cycle sequence of fission yeast
• Genetic networks with canalyzing Boolean rules are always stable
• Boolean nested canalizing functions: a comprehensive analysis
• Regulatory patterns in molecular interaction networks
• The phase diagram of random Boolean networks with nested canalizing functions
• Harmonic Analysis of Boolean Networks: Determinative Power and Perturbations
• Analysis of random Boolean networks using the average sensitivity