Regular articleA Numerical Study of the Critical Line of Kauffman Networks
Abstract
Kauffman networks were introduced in 1969 as a model of genetic regulatory systems. One of the most striking successes of this model is its ability to reproduce, for a critical value of its parameters, the observed scaling laws of the average cell replication time and of the average number of cell types in a given organism vs. the number of genes. Yet, the numerical evidence for such scaling laws in the model is still unsatisfactory, and restricted to a particular critical point, while we expect that the scaling behaviour is universal along the critical line. In this paper we try to sharpen the evidence for the scaling behaviour of critical systems, carrying on a detailed numerical investigation of their properties. We measure the length of the cycles (which in the model represents the period of cell cycles) and their number (which represents the number of cell types) for a point of the critical line different from the only one previously studied. Our results seem to confirm that such quantities scale as √Nfor all critical systems, at least for lengths and numbers small enough. On the other hand, we found that their probability distributions are very broad (power-law like) and become broader with system size. This means that there is an effective scale of the length and of the number of cycles that increases much faster than √N, and in the infinite size limit the biological analogy found by Kauffman may be lost. A numerical study of the modular structure of critical networks supports this conclusion. The implications of this fact for the biological interpretation of the model are briefly discussed. Finally, we found that the typical weight of the attraction basins tends to zero as a power law in the infinite size limit, with an exponent which seems to be universal along the whole critical line.
References (0)
Cited by (52)
A multi-objective differential evolutionary approach toward more stable gene regulatory networks
2009, BioSystemsModels are of central importance in many scientific contexts. Mathematical and computational modeling of genetic regulatory networks promises to uncover the fundamental principles of living systems. Biological models, such as gene regulatory models, can help us better understand interactions among genes and how cells regulate their production of proteins and enzymes. One feature shared among living systems is their ability to cope with perturbations and remain stable, a property that is the result of evolutionary fine-tuning over many generations. In this study we use random Boolean networks (RBNs) as an abstract model of gene regulatory systems. By applying Differential Evolution (DE), an evolution-based optimization technique, we produce networks with increased stability. DE requires relatively few user-specified parameters, has fast convergence and does not rely on initial conditions to find the global minima within multi-dimensional search spaces.
The stability of networks is evaluated by taking parameters such as their network sensitivity, attractor cycle length and number of attractor basins into account. In this study we present an evolutionary approach to produce networks with specific properties (high stability) starting from chaotic regimes. From this chaotic regime and randomly generated classical RBNs with static input degree, our evolutionary approach is able to produce networks with homogenous Boolean functions and highly structured state spaces.
Intrinsic properties of Boolean dynamics in complex networks
2009, Journal of Theoretical BiologyWe study intrinsic properties of attractor in Boolean dynamics of complex networks with scale-free topology, comparing with those of the so-called Kauffman's random Boolean networks. We numerically study both frozen and relevant nodes in each attractor in the dynamics of relatively small networks (). We investigate numerically robustness of an attractor to a perturbation. An attractor with cycle length of in a network of size N consists of states in the state space of states; each attractor has the arrangement of N nodes, where the cycle of attractor sweeps states. We define a perturbation as a flip of the state on a single node in the attractor state at a given time step. We show that the rate between unfrozen and relevant nodes in the dynamics of a complex network with scale-free topology is larger than that in Kauffman's random Boolean network model. Furthermore, we find that in a complex scale-free network with fluctuation of the in-degree number, attractors are more sensitive to a state flip for a highly connected node (i.e. input-hub node) than to that for a less connected node. By some numerical examples, we show that the number of relevant nodes increases, when an input-hub node is coincident with and/or connected with an output-hub node (i.e. a node with large output-degree) one another.
Boolean dynamics of Kauffman models with a scale-free network
2007, Journal of Theoretical BiologyWe study the Boolean dynamics of the “quenched” Kauffman models with a directed scale-free network, comparing with that of the original directed random Kauffman networks and that of the directed exponential-fluctuation networks. We have numerically investigated the distributions of the state cycle lengths and its changes as the network size N and the average degree of nodes increase. In the relatively small network , the median, the mean value and the standard deviation grow exponentially with N in the directed scale-free and the directed exponential-fluctuation networks with , where the function forms of the distributions are given as an almost exponential. We have found that for the relatively large the growth of the median of the distribution over the attractor lengths asymptotically changes from algebraic type to exponential one as the average degree goes to . The result supports the existence of the transition at derived in the annealed model.
A numerical investigation of the critical phase of random boolean networks
2007, Modern Physics Letters BFinite size corrections to random Boolean networks
2006, Journal of Statistical Mechanics: Theory and Experiment