Tracking perturbations in Boolean networks with spectral methods.
In this paper we present a method for predicting the spread of perturbations in Boolean networks. The method is applicable to networks that have no regular topology. The prediction of perturbations can be performed easily by using a presented result which enables the efficient computation of the required iterative formulas. This result is based on abstract Fourier transform of the functions in the network. In this paper the method is applied to show the spread of perturbations in networks containing a distribution of functions found from biological data. The advances in the study of the spread of perturbations can directly be applied to enable ways of quantifying chaos in Boolean networks. Derrida plots over an arbitrary number of time steps can be computed and thus distributions of functions compared with each other with respect to the amount of order they create in random networks.
Kesseli
Juha
J
Institute of Signal Processing, Tampere University of Technology, P.O. Box 553, 33101 Tampere, Finland. kesseli@cs.tut.fi
Rämö
Pauli
P
Yli-Harja
Olli
O