On random Boolean threshold networks

Authors

Reinhard Heckel, Steffen Schober, and Martin Bossert

Reference

International ITG Conference on Source and Channel Coding, Singen, Germany, Jan. 2010.

Abstract

Ensembles of Boolean networks using linear random threshold functions with memory are considered. Such ensembles have been studied previously by Szejka et al. They obtained analytical results for the order parameter which can be used to predict the expected behavior of a network randomly drawn from the ensemble. Using numerical simulations of randomly drawn networks, Szejka et al. found marked deviations from the predicted behavior. In this work improved analytical results are provided that better match up the numerical results. Furthermore, the critical point in their analysis is identified. In the model studied, each node is not only dependent on the K regular inputs, but also on the previous state of the node. The results show that this feedback loop accounts for the low order parameter and tolerance on random errors, even for networks with high in-degree.

Download this document:

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.