Mutual information in random Boolean models of regulatory networks

Abstract

The amount of mutual information contained in time series of two elements gives a measure of how well their activities are coordinated. In a large, complex network of interacting elements, such as a genetic regulatory network within a cell, the average of the mutual information over all pairs <I> is a global measure of how well the system can coordinate its internal dynamics. We study this 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. Efficient numerical methods for calculating <I> show that as the number of network nodes N approaches infinity, the quantity N<I> exhibits a discontinuity at parameter values corresponding to critical RBNs. For finite systems it peaks near the critical value, but slightly in the disordered regime for typical parameter variations. The source of high values of N<I> is the indirect correlations between pairs of elements from different long chains with a common starting point. The contribution from pairs that are directly linked approaches zero for critical networks and peaks deep in the disordered regime.

11 pages, 6 figures; Minor revisions for clarity and figure format, one reference added

References in corpus (1)

• Exhaustive percolation on random networks

Cited by in corpus (18)

• Colloquium: Criticality and dynamical scaling in living systems
• Localizations on Complex Networks
• Intrinsic noise and deviations from criticality in Boolean gene-regulatory networks
• Quantifying the complexity of random Boolean networks
• Harmonic Analysis of Boolean Networks: Determinative Power and Perturbations
• Introducing Astrocytes on a Neuromorphic Processor: Synchronization, Local Plasticity and Edge of Chaos
• Maximum Power Efficiency and Criticality in Random Boolean Networks
• Coevolution of Information Processing and Topology in Hierarchical Adaptive Random Boolean Networks
• Boolean Networks Design by Genetic Algorithms
• Rényi Information flow in the Ising model with single-spin dynamics
• The Value of Conflict in Stable Social Networks
• Phase transition in a class of non-linear random networks
• The maximum mutual information between the output of a binary symmetric channel and a Boolean function of its input
• Maximal Information Transfer and Behavior Diversity in Random Threshold Networks
• Analysis of attractor distances in Random Boolean Networks
• The maximum mutual information between the output of a discrete symmetric channel and several classes of Boolean functions of its input
• Dynamical systems analysis of stack filters
• Boolean network robotics: a proof of concept