Canalizing Boolean Functions Maximize Mutual Information
From MaRDI portal
Abstract: The ability of information processing in biologically motivated Boolean networks is of interest in recent information theoretic research. One measure to quantify this ability is the well known mutual information. Using Fourier analysis we show that canalizing functions maximize the mutual information between an input variable and the outcome of the function. We proof our result for Boolean functions with uniform distributed as well as product distributed input variables.
Recommendations
- CommentsComments on “Canalizing Boolean Functions Maximize Mutual Information”
- Boolean Functions: Noise Stability, Non-Interactive Correlation Distillation, and Mutual Information
- scientific article; zbMATH DE number 1962877
- Exponential separation of information and communication for Boolean functions
- Which Boolean Functions Maximize Mutual Information on Noisy Inputs?
- Exponential Separation of Information and Communication for Boolean Functions
- Maximal sensitivity of Boolean nested canalizing functions
- Revealing the canalizing structure of Boolean functions: algorithms and applications
- Collectively canalizing Boolean functions
- Dictator functions maximize mutual information
Cited in
(6)- Dictator functions maximize mutual information
- Stratification and enumeration of Boolean functions by canalizing depth
- Entropy analysis of Boolean network reduction according to the determinative power of nodes
- Logical reduction of biological networks to their most determinative components
- Event-triggered control for output regulation of probabilistic Boolean control networks under dimension reduction method
- Stability analysis for switched Boolean networks with minimum dwell time
This page was built for publication: Canalizing Boolean Functions Maximize Mutual Information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986438)
