Stuart Kauffman
580 California St., Suite 400
San Francisco, CA, 94104
Scaling in Ordered and Critical Random Boolean Networks
2003, Physical Review Letters
https://doi.org/10.1103/PHYSREVLETT.90.068702visibility
…
description
4 pages
link
1 file
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
AI
AI
Random Boolean networks (RBNs) serve as models for complex systems, particularly those in biological contexts such as genetic regulatory networks. This analysis determines the scaling behavior of relevant nodes and attractors in RBNs, specifically in ordered and critical regimes. It is shown that in the ordered state, the average number of relevant nodes remains constant as network size (N) increases, while in critical networks the number of relevant nodes scales as N^1/3, alongside a median growth in attractor numbers that surpasses linearity with N. These findings enhance understanding of dynamical properties that are essential for real-world biological systems.
Related papers
Perturbation in Genetic Regulatory Networks: Simulation and Experiments
2004
Random boolean networks (RBN) have been proposed more than thirty years ago as models of genetic regulatory networks. Recent studies on the perturbation in gene expression levels induced by the knock-out (i.e. silencing) of single genes have shown that simple RBN models give rise to a distribution of the size of the perturbations which is very similar in different model network realizations, and is also very similar to the one actually found in experimental data concerning a unicellular organism (S.cerevisiae). In this paper we present further results, based upon the same set of experiments, concerning the correlation between different perturbations. We compare actual data from S. cerevisiae with the results of simulations concerning RBN models with more than 6000 nodes, and comment on the usefulness and limitations of RBN models.
Complex and unexpected dynamics in simple genetic regulatory networks
International Journal of Modern Physics B, 2014
One aim of synthetic biology is to construct increasingly complex genetic networks from interconnected simpler ones to address challenges in medicine and biotechnology. However, as systems increase in size and complexity, emergent properties lead to unexpected and complex dynamics due to nonlinear and nonequilibrium properties from component interactions. We focus on four different studies of biological systems which exhibit complex and unexpected dynamics. Using simple synthetic genetic networks, small and large populations of phase-coupled quorum sensing repressilators, Goodwin oscillators, and bistable switches, we review how coupled and stochastic components can result in clustering, chaos, noise-induced coherence and speed-dependent decision making. A system of repressilators exhibits oscillations, limit cycles, steady states or chaos depending on the nature and strength of the coupling mechanism. In large repressilator networks, rich dynamics can also be exhibited, such as clu...
Interacting Random Boolean Networks
Random Boolean networks (RBN) have been extensively studied as models of genetic regulatory networks. While many studies have been devoted to the dynamics of isolated random Boolean networks, which may considered as models of isolated cells, in this paper we consider a set of interacting RBNs, which may be regarded as a simplified model of a tissue or a monoclonal colony. In order to do so, we introduce a cellular automata (CA) model, where each cell site is occupied by a RBN. The mutual influence among cells is modelled by letting the activation of some genes in a RBN be affected by that of some genes in neighbouring RBNs. It is shown that the dynamics of the CA is far from trivial. Different measures are introduced to provide indications about the overall behaviour. In a sense which is made precise in the text, it is shown that the degree of order of the CA is affected by the interaction strength, and that markedly different behaviours are observed. We propose a classification of these behaviours into four classes, based upon the way in which the various measures of order are affected by the interaction strength. It is shown that the dynamical properties of isolated RBNs affect the probability that a CA composed by those RBNs belongs to one of the four classes, and therefore also affects the probability that a higher interaction strength leads to a greater, or a smaller, degree of order.
Majority Rules with Random Tie-Breaking in Boolean Gene Regulatory Networks
PLoS ONE, 2013
We consider threshold Boolean gene regulatory networks, where the update function of each gene is described as a majority rule evaluated among the regulators of that gene: it is turned ON when the sum of its regulator contributions is positive (activators contribute positively whereas repressors contribute negatively) and turned OFF when this sum is negative. In case of a tie (when contributions cancel each other out), it is often assumed that the gene keeps it current state. This framework has been successfully used to model cell cycle control in yeast. Moreover, several studies consider stochastic extensions to assess the robustness of such a model. Here, we introduce a novel, natural stochastic extension of the majority rule. It consists in randomly choosing the next value of a gene only in case of a tie. Hence, the resulting model includes deterministic and probabilistic updates. We present variants of the majority rule, including alternate treatments of the tie situation. Impact of these variants on the corresponding dynamical behaviours is discussed. After a thorough study of a class of two-node networks, we illustrate the interest of our stochastic extension using a published cell cycle model. In particular, we demonstrate that steady state analysis can be rigorously performed and can lead to effective predictions; these relate for example to the identification of interactions whose addition would ensure that a specific state is absorbing.
Homogeneous and scalable gene expression regulatory networks with random layouts of switching parameters
2003
We consider a model of large regulatory gene expression networks where the thresholds activating the sigmoidal interactions between genes and the signs of these interactions are shuffled randomly. Such an approach allows for a qualitative understanding of network dynamics in a lack of empirical data concerning the large genomes of living organisms.
Higher order Boolean networks as models of cell state dynamics
Journal of Theoretical Biology, 2010
The regulation of the cell state is a complex process involving several components. These complex dynamics can be modeled using Boolean networks, allowing us to explain the existence of different cell states and the transition between them. Boolean models have been introduced both as specific examples and as ensemble or distribution network models. However, current ensemble Boolean network models do not make a systematic distinction between different cell components such as epigenetic factors, gene and transcription factors. Consequently, we still do not understand their relative contributions in controlling the cell fate. In this work we introduce and study higher order Boolean networks, which feature an explicit distinction between the different cell components and the types of interactions between them. We show that the stability of the cell state dynamics can be determined solving the eigenvalue problem of a matrix representing the regulatory interactions and their strengths. The qualitative analysis of this problem indicates that, in addition to the classification into stable and chaotic regimes, the cell state can be simple or complex depending on whether it can be deduced from the independent study of its components or not. Finally, we illustrate how the model can be expanded considering higher levels and higher order dynamics.
A Model of Gene Expression Based on Random Dynamical Systems Reveals Modularity Properties of Gene Regulatory Networks
Here we propose a new approach to modeling gene expression based on the theory of random dynamical systems (RDS) that provides a general coupling prescription between the nodes of any given regulatory network provided the dynamics of each node is modeled by a RDS. The main virtues of this approach are the following: (i) it provides a natural way to obtain arbitrarily complicated systems by coupling together simple basic pieces, thus revealing the modularity of regulatory networks; (ii) the assumptions about the stochastic processes used in the modeling are fairly general, in the sense that the only requirement is stationarity; (iii) there is a well developed mathematical theory, which is a blend of smooth dynamical systems theory, ergodic theory and stochastic analysis that allows one to extract relevant dynamical and statistical information without solving the system; (iv) the time evolution can be easily discretized, rendering the dynamics suitable for computer simulation in a simple and direct way. Finally, it is shown that one obtains the classical rate equations form the stochastic models by averaging over an ensemble.
Function constrains network architecture and dynamics: A case study on the yeast cell cycle Boolean network
Physical Review E, 2007
We develop a general method to explore how the function performed by a biological network can constrain both its structural and dynamical network properties. This approach is orthogonal to prior studies which examine the functional consequences of a given structural feature, for example a scale free architecture. A key step is to construct an algorithm that allows us to efficiently sample from a maximum entropy distribution on the space of Boolean dynamical networks constrained to perform a specific function, or cascade of gene expression. Such a distribution can act as a "functional null model" to test the significance of any given network feature, and can aid in revealing underlying evolutionary selection pressures on various network properties. Although our methods are general, we illustrate them in an analysis of the yeast cell cycle cascade. This analysis uncovers strong constraints on the architecture of the cell cycle regulatory network as well as significant selection pressures on this network to maintain ordered and convergent dynamics, possibly at the expense of sacrificing robustness to structural perturbations.
Noisy attractors and ergodic sets in models of gene regulatory networks
Journal of Theoretical Biology, 2007
We investigate the hypothesis that cell types are attractors. This hypothesis was criticized with the fact that real gene networks are noisy systems and thus, do not have attractors . Given the concept of "ergodic set" as a set of states from which the system, once entering, does not leave when subject to internal noise, first, using the Boolean network model, we show that if all nodes of states on attractors are subject to internal state change with a probability p due to noise, multiple ergodic sets are very unlikely. Thereafter, we show that if a fraction of those nodes are "locked" (not subject to state fluctuations caused by internal noise), multiple ergodic sets emerge.
On the underlying assumptions of threshold Boolean networks as a model for genetic regulatory network behavior
Frontiers in Genetics, 2013
Boolean networks (BoN) are relatively simple and interpretable models of gene regulatory networks. Specifying these models with fewer parameters while retaining their ability to describe complex regulatory relationships is an ongoing methodological challenge. Additionally, extending these models to incorporate variable gene decay rates, asynchronous gene response, and synergistic regulation while maintaining their Markovian nature increases the applicability of these models to genetic regulatory networks (GRN). We explore a previously-proposed class of BoNs characterized by linear threshold functions, which we refer to as threshold Boolean networks (TBN). Compared to traditional BoNs with unconstrained transition functions, these models require far fewer parameters and offer a more direct interpretation. However, the functional form of a TBN does result in a reduction in the regulatory relationships which can be modeled. We show that TBNs can be readily extended to permit self-degradation, with explicitly modeled degradation rates. We note that the introduction of variable degradation compromises the Markovian property fundamental to BoN models but show that a simple state augmentation procedure restores their Markovian nature. Next, we study the effect of assumptions regarding self-degradation on the set of possible steady states. Our findings are captured in two theorems relating self-degradation and regulatory feedback to the steady state behavior of a TBN. Finally, we explore assumptions of synchronous gene response and asynergistic regulation and show that TBNs can be easily extended to relax these assumptions. Applying our methods to the budding yeast cell-cycle network revealed that although the network is complex, its steady state is simplified by the presence of self-degradation and lack of purely positive regulatory cycles.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.
References (12)
- S. A. Kauffman, J. Theor. Bio. 22, 437 (1969).
- S. A. Kauffman, Origins of Order (Oxford University Press, Oxford, 1993).
- M. Aldana, S. Coppersmith, and L. P. Kadanoff, http://arXiv.org/abs/nlin.AO/0204062 (2002).
- U. Bastolla and G. Parisi, Physica D 115, 203 (1998).
- S. Bilke and F. Sjunnesson, Phys. Rev. E 65, 016129 (2001).
- H. Flyvbjerg and N. J. Kjaer, J. Phys. A 21, 1695 (1988).
- B. Derrida and H. Flyvbjerg, J. Phys. A 20, L1107 (1987).
- B. Derrida and Y. Pomeau, Europhys. Lett. 1, 45 (1986).
- B. Derrida and G. Weisbuch, J. Phys. 47, 1297 (1986).
- H. Flyvbjerg, J. Phys. A 21, L955 (1988).
- M. E. J. Newman, S. H. Strogatz, and D. J. Watts, Phys. Rev. E 64, 026118 (2001).
- See J. F. Lynch, Random Struct. Algor 6, 239 (1995) and http://arXiv.org/abs/adap-org/9305001 (1993) for related results on cycle lengths.