# Harmonic analysis of Boolean networks: determinative power and perturbations

@article{Heckel2013HarmonicAO, title={Harmonic analysis of Boolean networks: determinative power and perturbations}, author={Reinhard Heckel and Steffen Schober and Martin Bossert}, journal={EURASIP Journal on Bioinformatics and Systems Biology}, year={2013}, volume={2013}, pages={6 - 6} }

Consider a large Boolean network with a feed forward structure. Given a probability distribution on the inputs, can one find, possibly small, collections of input nodes that determine the states of most other nodes in the network? To answer this question, a notion that quantifies the determinative power of an input over the states of the nodes in the network is needed. We argue that the mutual information (MI) between a given subset of the inputs X={X1,...,Xn} of some node i and its associated…

## 15 Citations

Logical Reduction of Biological Networks to Their Most Determinative Components

- Computer ScienceBulletin of mathematical biology
- 2016

This article considers a recently introduced method for reducing a Boolean network to its most determinative nodes that yield the highest information gain and obtains a stronger result than in previous works, showing that a large information gain from a set of input nodes generates increased sensitivity to perturbations of those inputs.

Boolean network topologies and the determinative power of nodes

- Computer ScienceJ. Complex Networks
- 2020

This work explores the correlation between the information stored in the Boolean functions for each node in a property known as the determinative power and some topological properties of each node, in particular the clustering coefficient and the betweenness centrality.

Identification of Biologically Essential Nodes via Determinative Power in Logical Models of Cellular Processes

- Computer ScienceFront. Physiol.
- 2018

An algorithm for finding a fairly small subnetwork, representing a collection of nodes that determine the states of most other nodes with a reasonable level of entropy, and shows that a large fraction of the most determinative nodes are essential and involved in crucial biological functions.

On canalizing Boolean functions

- Computer Science
- 2014

This work derives spectral properties of canalizing and nested canalizing functions, which can also be used to test membership of functions to these classes, and provides relationships between the noise sensitivity and the mutual information of functions with noisy inputs.

Properties of Boolean networks and methods for their tests

- Mathematics, Computer ScienceEURASIP J. Bioinform. Syst. Biol.
- 2013

This article discusses several algorithms to test the properties of Boolean functions (BFs), and applies them to a transcriptional regulation network of Escherichia coli, which controls central parts of the E. coli metabolism and finds that all functions are unate.

Bounds on the Average Sensitivity of Nested Canalizing Functions

- Computer Science, MathematicsPloS one
- 2013

A tight upper bound on the average sensitivity of NCFs as a function of the number of relevant input variables is provided, which shows that a large number of functions appearing in biological networks belong to a class that has low average sensitivity, which is even close to a tight lower bound.

Canalizing Boolean Functions Maximize Mutual Information

- Computer ScienceIEEE Transactions on Information Theory
- 2014

Using Fourier analysis, it is shown that canalizing functions maximize mutual information between a single input variable and the outcome of a function with fixed expectation, and that the mutual information is maximized by a function only dependent on this single variable, i.e., the dictatorship function.

Capturing dynamic relevance in Boolean networks using graph theoretical measures

- Computer ScienceBioinform.
- 2021

This work designed an approach to identify dynamically relevant compounds based on the static network topology and validated the method’s working concept on logical models, which can be readily scaled up to complex interaction networks, where dynamic analyses are not even feasible.

Characterizing short-term stability for Boolean networks over any distribution of transfer functions

- Computer Science, MathematicsPhysical review. E
- 2016

A formula is presented that determines whether short-term chaos (damage spreading) will happen in Kauffman's NK (random) Boolean networks under arbitrary distributions of transfer functions.

Partial Information Decomposition of Boolean Functions: a Fourier Analysis perspective

- Computer ScienceArXiv
- 2020

This paper establishes for Boolean gates mechanisms a relation between their PID components and Fourier coefficients and focuses here on Boolean gates, a much-studied type of source-target mechanisms.

## References

SHOWING 1-10 OF 37 REFERENCES

Mutual information in random Boolean models of regulatory networks.

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2008

This work studies average pairwise mutual information in random Boolean networks (RBNs) as a function of the distribution of Boolean rules implemented at each element, assuming that the links in the network are randomly placed.

Dynamics of Boolean networks controlled by biologically meaningful functions.

- Computer ScienceJournal of theoretical biology
- 2002

The effect on the dynamics of using only Boolean functions which are meaningful in a biological sense which further support the idea of the usefulness of logical networks as a conceptual framework for the understanding of real-world phenomena.

On the sensitivity to noise of a Boolean function

- Mathematics
- 2009

In this paper we generate upper and lower bounds for the sensitivity to noise of a Boolean function using relaxed assumptions on input choices and noise. The robustness of a Boolean network to noisy…

Reveal, a general reverse engineering algorithm for inference of genetic network architectures.

- Computer SciencePacific Symposium on Biocomputing. Pacific Symposium on Biocomputing
- 1998

This study investigates the possibility of completely infer a complex regulatory network architecture from input/output patterns of its variables using binary models of genetic networks, and finds the problem to be tractable within the conditions tested so far.

An analysis of the class of gene regulatory functions implied by a biochemical model.

- BiologyBio Systems
- 2006

Tracking perturbations in Boolean networks with spectral methods.

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2005

The method is applied to show the spread of perturbations in networks containing a distribution of functions found from biological data to enable ways of quantifying chaos in Boolean networks.

Random networks of automata: a simple annealed approximation

- Computer Science
- 1986

This work gives a simple annealed approximation which predicts K = 2 as the critical value of K and gives also quantitative predictions for distances between iterated configurations.

Metabolic stability and epigenesis in randomly constructed genetic nets.

- BiologyJournal of theoretical biology
- 1969

Boolean Network Model Predicts Cell Cycle Sequence of Fission Yeast

- BiologyPloS one
- 2008

A Boolean network model of the cell-cycle regulatory network of fission yeast (Schizosaccharomyces Pombe) is constructed solely on the basis of the known biochemical interaction topology, and indicates that the biological dynamical sequence is robustly implemented in the regulatory network.