Reversible Boolean networks. I: Distribution of cycle lengths

DOI10.1016/S0167-2789(00)00198-6MaRDI QIDQ5932054zbMATH OpenWikidataFDO

Authors S. N. Coppersmith, Leo P. Kadanoff, Zhitong Zhang

Publication date 25 January 2003

Published in Physica D (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cond-mat/0004422

zbMATH Keywords

cellular automata cycle length gene regulatory networks random Boolean networks time-reversible Boolean networks

Mathematics Subject Classification ID

Abstract: We consider a class of models describing the dynamics of

N

Boolean variables, where the time evolution of each depends on the values of

K

of the other variables. Previous work has considered models with dissipative dynamics. Here we consider time-reversible models, which necessarily have the property that every possible point in the state-space is an element of one and only one cycle. As in the dissipative case, when K is large, typical orbit lengths grow exponentially with N, whereas for small enough K, typical orbit lengths grow much more slowly with N. The numerical data are consistent with the existence of a phase transition at which the average orbit length grows as a power of N at a value of K between 1.4 and 1.7. However, in the reversible models the interplay between the discrete symmetry and quenched randomness can lead to enormous fluctuations of orbit lengths and other interesting features that are unique to the reversible case. The orbits can be classified by their behavior under time reversal. The orbits that transform into themselves under time reversal have properties quite different from those that do not; in particular, a significant fraction of latter-type orbits have lengths enormously longer than orbits that are time reversal-symmetric. For large K and moderate N, the vast majority of points in the state-space are on one of the time reversal singlet orbits, and a random hopping model gives an accurate description of orbit lengths. However, for any finite K, the random hopping approximation fails qualitatively when N is large enough (

N g g 2^{(2^{K})}

).

Review text

This article discusses a class of time-reversible models describing the dynamics of \(N\) Boolean variables, where the time evolution of each variable depends on the values of \(K\) other variables. NEWLINENEWLINENEWLINEThe authors introduce the concept of special points and the distinction between special cycles and regular cycles. The relation between special points and the properties of the cycles is demonstrated. They show that the numbers of special points and special cycles for each realization are proportional to \(\omega=2^N\), where \(N\) is the number of variables in the system. NEWLINENEWLINENEWLINEThe correlation between typical cycle length and the \(K\) values of the networks is studied, and the authors find that the typical cycle length increases logarithmically with \(N\) when \(K<1.4\), exponentially when \(K>1.7\), and following a power law when \(K\) falls in between these two values.

Recommendations

Cited in

(7)

This page was built for publication: Reversible Boolean networks. I: Distribution of cycle lengths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5932054)