pith. sign in

arxiv: adap-org/9907001 · v1 · submitted 1999-06-30 · adap-org · nlin.AO

Lyapunov Exponents in Random Boolean Networks

classification adap-org nlin.AO
keywords booleanlyapunovrandomallowingapproximationexponentsmethodnetworks
0
0 comments X
read the original abstract

A new order parameter approximation to Random Boolean Networks (RBN) is introduced, based on the concept of Boolean derivative. A statistical argument involving an annealed approximation is used, allowing to measure the order parameter in terms of the statistical properties of a random matrix. Using the same formalism, a Lyapunov exponent is calculated, allowing to provide the onset of damage spreading through the network and how sensitive it is to minimal perturbations. Finally, the Lyapunov exponents are obtained by means of different approximations: through distance method and a discrete variant of the Wolf's method for continuous systems.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.