相关论文: Critical Kauffman networks under deterministic asy…

We show that the mean number of attractors in a critical Boolean network under asynchronous stochastic update grows like a power law and that the mean size of the attractors increases as a stretched exponential with the system size. This is…

The Kauffman model describes a system of randomly connected nodes with dynamics based on Boolean update functions. Though it is a simple model, it exhibits very complex behavior for "critical" parameter values at the boundary between a…

The evaluation of the number of attractors in Kauffman networks by Samuelsson and Troein is generalized to critical networks with one input per node and to networks with two inputs per node and different probability distributions for update…

Despite their apparent simplicity, random Boolean networks display a rich variety of dynamical behaviors. Much work has been focused on the properties and abundance of attractors. We here derive an expression for the number of attractors in…

Boolean Networks (BNs) describe the time evolution of binary states using logic functions on the nodes of a network. They are fundamental models for complex discrete dynamical systems, with applications in various areas of science and…

In this paper we try to end the debate concerning the suitability of different updating schemes in random Boolean networks (RBNs). We quantify for the first time loose attractors in asyncrhonous RBNs, which allows us to analyze the…

Boolean networks at the critical point have been a matter of debate for many years as, e.g., scaling of number of attractor with system size. Recently it was found that this number scales superpolynomially with system size, contrary to a…

Random Boolean networks were introduced in 1969 by Kauffman as a model for gene regulation. By combining analytical arguments and efficient numerical simulations, we evaluate the properties of relevant components of critical random Boolean…

In this paper we study the phase transitions of different types of Random Boolean networks. These differ in their updating scheme: synchronous, semi-synchronous, or asynchronous, and deterministic or non-deterministic. It has been shown…

This is the first of two papers about the structure of Kauffman networks. In this paper we define the relevant elements of random networks of automata, following previous work by Flyvbjerg and Flyvbjerg and Kjaer, and we study numerically…

Boolean networks are discrete dynamical systems where each automaton has its own Boolean function for computing its state according to the configuration of the network. The updating mode then determines how the configuration of the network…

Random Boolean networks, originally invented as models of genetic regulatory networks, are simple models for a broad class of complex systems that show rich dynamical structures. From a biological perspective, the most interesting networks…

Using analytic arguments, we show that dynamical attractor periods in large critical Boolean networks are power-law distributed. Our arguments are based on the method of relevant components, which focuses on the behavior of the nodes that…

This review explains in a self-contained way the properties of random Boolean networks and their attractors, with a special focus on critical networks. Using small example networks, analytical calculations, phenomenological arguments, and…

We propose the use of Deterministic Generalized Asynchronous Random Boolean Networks [Gershenson, 2002] as models of contextual deterministic discrete dynamical systems. We show that changes in the context have drastic effects on the global…

We derive mostly analytically the scaling behavior of the number of nonfrozen and relevant nodes in critical Kauffman networks (with two inputs per node) in the thermodynamic limit. By defining and analyzing a stochastic process that…

We provide the first classification of different types of Random Boolean Networks (RBNs). We study the differences of RBNs depending on the degree of synchronicity and determinism of their updating scheme. For doing so, we first define…

We introduce a numerical method to study random Boolean networks with asynchronous stochas- tic update. Each node in the network of states starts with equal occupation probability and this probability distribution then evolves to a steady…

This is the second paper of a series of two about the structural properties that influence the asymptotic dynamics of Random Boolean Networks. Here we study the functionally independent clusters in which the relevant elements, introduced…

The critical Kauffman model with connectivity one is the simplest class of critical Boolean networks. Nevertheless, it exhibits intricate behavior at the boundary of order and chaos. We introduce a formalism for expressing the dynamics of…