Coevolution of Information Processing and Topology in Hierarchical Adaptive Random Boolean Networks

Abstract

Random Boolean networks (RBNs) are frequently employed for modelling complex systems driven by information processing, e.g. for gene regulatory networks (GRNs). Here we propose a hierarchical adaptive RBN (HARBN) as a system consisting of distinct adaptive RBNs - subnetworks - connected by a set of permanent interlinks. Information measures and internal subnetworks topology of HARBN coevolve and reach steady-states that are specific for a given network structure. We investigate mean node information, mean edge information as well as a mean node degree as functions of model parameters and demonstrate HARBN's ability to describe complex hierarchical systems.

9 pages, 6 figures

References in corpus (8)

• Power-law distributions in empirical data
• Nonequilibrium phase transition in the coevolution of networks and opinions
• Mutual information in random Boolean models of regulatory networks
• Computational Capabilities of Random Automata Networks for Reservoir Computing
• Emergent Criticality from Co-evolution in Random Boolean Networks
• Ising model on two connected Barabasi-Albert networks
• Rigidity and flexibility of biological networks
• Information slows down hierarchy growth