Complexity / 2019 / Article
Special Issue

Boolean Networks and Their Applications in Science and Engineering

View this Special Issue

Research Article | Open Access

Volume 2019 |Article ID 3728621 |

Omar K. Pineda, Hyobin Kim, Carlos Gershenson, "A Novel Antifragility Measure Based on Satisfaction and Its Application to Random and Biological Boolean Networks", Complexity, vol. 2019, Article ID 3728621, 10 pages, 2019.

A Novel Antifragility Measure Based on Satisfaction and Its Application to Random and Biological Boolean Networks

Academic Editor: Massimiliano Zanin
Received17 Dec 2018
Accepted23 Apr 2019
Published28 May 2019


Antifragility is a property that enhances the capability of a system in response to external perturbations. Although the concept has been applied in many areas, a practical measure of antifragility has not been developed yet. Here we propose a simply calculable measure of antifragility, based on the change of “satisfaction” before and after adding perturbations, and apply it to random Boolean networks (RBNs). Using the measure, we found that ordered RBNs are the most antifragile. Also, we demonstrated that seven biological systems are antifragile. Our measure and results can be used in various applications of Boolean networks (BNs) including creating antifragile engineering systems, identifying the genetic mechanism of antifragile biological systems, and developing new treatment strategies for various diseases.

1. Introduction

Antifragility suggested by Taleb is defined as a property to enhance the capability of a system in response to external stressors [1]. It is beyond resilience or robustness. While the resilient/robust systems resist stress and stay the same, antifragile systems not only withstand stress but also benefit from it. The immune system is a representative example of antifragile systems. When exposed to diverse germs at an early age, our immune system strengthens and thus overcomes new diseases in the future.

The concept of antifragility has been actively applied in numerous areas such as risk analysis [2, 3], physics [4], molecular biology [5, 6], transportation planning [7, 8], engineering [911], and aerospace and computer science [1215]. However, a practical measure of antifragility has not been developed yet. Here we propose a novel measure for antifragility based on the change of complexity. We use random Boolean networks (RBNs) as a case study to illustrate our measure. We quantify the complexity by assessing the extent of how much the node states of a RBN are maintained and changed during state transitions. We perturb the network, flipping the node states with the structure of the network fixed. Calculating the variation of the complexity in the network before and after adding the perturbations, we measure antifragility.

BNs have a wide range of applications from biochemical systems [1620], to economic systems [21], from social networks, [22, 23] to robots [24]. Our antifragility measure can be utilized in various applications of BNs. For instance, one could create antifragile engineered systems or identify the genetic mechanisms of antifragile biological systems.

The rest of our article is structured as follows. In the section of “Measurement of Antifragility in RBNs”, we describe RBNs, complexity of RBNs, perturbations to RBNs, and how to assess antifragility in RBNs. In the section “Experiments”, methods and parameter setting for simulations are explained. In the section of “Results and Discussion”, the results of the antifragility of RBNs and several biological BNs are presented and analyzed. The section of “Conclusions” summarizes and closes the article.

2. Measurement of Antifragility in RBNs

2.1. Random Boolean Networks

RBNs were proposed as models of gene regulatory networks by Kauffman [26, 27]. A RBN consists of N nodes representing genes. Each node can take either 0 (off, inhibited) or 1 (on, activated) as its state. The node state is determined by the states of input nodes and Boolean functions assigned to each node. Every node has K input nodes (or input links). Self-inputs are allowed. The links are wired randomly, and the Boolean functions are also randomly assigned. Once the links and the Boolean functions set up, they remain fixed.

In Figures 1(a) and 1(b), the left plots show how randomly chosen initial states are updated over time. The plots are simulated until = 40. A state space refers to the set of all the possible configurations (2N) and all the transitions among them. Being deterministic, classic RBNs have one and only one successor for each state. In the state space, repeated states are attractors, which can be fixed points or limit cycles. The other states that lead to the attractors are basin of attraction of the attractors.

Depending on the structure of the state space, there are three dynamical regimes in RBNs: ordered, chaotic, and critical. The first two are phases, while the critical regime lies at the phase transition. Ordered dynamics are characterized by the change of few node states, which is related to high stability. Chaotic dynamics are characterized by the change of most node states, which is associated with high variability. Critical dynamics balance the stability of the ordered regime with the variability of the chaotic regime [28, 29]. The dynamical regimes can be varied by . For RBNs with internal homogeneity (i.e., the probability that a gene is activated [30]) = 0.5, = 1 is ordered, = 2 is critical, and 2 is chaotic, on average [31]. Other properties of RBNs can be used to regulate dynamical regimes [32].

2.2. Complexity of RBNs

It is well known that complex adaptive systems are equipped with stability and flexibility simultaneously. Here complexity signifies a balance between regularity and change, which allows systems to adapt robustly [27, 33, 34]. From an information viewpoint, the regularity ensures that useful information survives, while the change enables the systems to explore new possibilities essential for adaptability. Living organisms or computer systems need not only stability to survive or to maintain information but also flexibility to evolve and adapt to their environment. Following this concept of complexity, we developed a quantitative measure [28]. Using our previous approach, we can measure the complexity of RBNs. In this study, complexity is presented as quantities computed according to our measure.

The complexity is calculated based on Shannon’s information entropy. Its equation is as follows:where is the “emergence” of node , is the probability that the state of the node is ( = 0, 1) among the states of node updated at each time step until simulation time , (0 1) is the complexity of the network, and (0 1) is the average of the emergence values for all the nodes. Specifically, () is calculated by counting the number of 0s (1s) in node until simulation time . For example, in the left plot of Figure 1(a), and of the last node are and , respectively. Because RBNs are deterministic systems, once initial states are determined, state transitions from them to attractors are also determined. Thus, and are dependent on initial states.

When is calculated, and in (1) should not be confused with which was mentioned as internal homogeneity in previous section. and are values measured from state transitions. Meanwhile, is a parameter used to create Boolean functions assigned to each node in a RBN. In the Boolean functions, each value is determined with probability of being one or probability of being zero.

, , and are time-dependent because they focus on the dynamics of node states. indicates how much new states are produced over time (i.e., change). As the complement of , represents how much existing states are maintained (i.e., regularity). means how successfully both of them are met. Numerically, reaches maximum when the emergence is 0.5 ( = 0.5 = 1). It is when the expression of any one of the two states is highly probable, i.e., or 0.89 for each node [25, 29]. Meanwhile, becomes 0 when the two states are evenly distributed ( = = 0.5; = 1) or only one state has maximum probability ( or = 1; = 0).

Figure 2 illustrates a mathematical relation between change , regularity , and complexity in RBNs [25]. As seen in the figure, high complexity is achieved when = , which means an optimal balance between keeping and changing the states of the network. For perturbed RBNs, Figure 1(a) shows that the antifragile network maintains original states overall and simultaneously explores new states by means of perturbations. Figure 1(b) represents that most of the states in the fragile network change with perturbations, which indicates that the network does not maintain information in a noisy environment.

2.3. Network Perturbations

We express network perturbations due to external stressors as the change of node states in a RBN. We flip the states of nodes randomly chosen, where the perturbations are added with frequency during simulation run time . In other words, the perturbations are added whenever the time step is divisible by ( = 0). For example, = 2, = 3, and = 99 mean that the states of two nodes randomly chosen in each configuration are flipped every three time steps until the simulation run time becomes 99. By comparing the state transitions of the original network and its perturbed network, we can observe how the perturbations propagate over time (Figure 1).

In our study, the degree of perturbations is defined as follows:where 0 1.

2.4. Antifragility of RBNs

We define (anti)fragility aswhere is the difference of “satisfaction” before and after perturbations, while is the degree of perturbations. To prevent the influence of node size of a network, we calibrate the values of by multiplying . The satisfaction is the degree to which the goals of an agent have been achieved [35]. In the context of RBNs, each node of the network can be seen as an agent. We can arbitrarily define their goal as reaching a balance between change and regularity, which is achieved when the nodes have high complexity values. Thus, in RBNs, the satisfaction is measured with complexity. Depending on how the satisfaction changes before and after perturbations, the RBN is classified: fragile, robust, or antifragile.

The satisfaction can be measured differently depending on the particular systems, e.g. performance, value, and fitness. If the satisfaction is decreased with perturbations, then the system is fragile. If the satisfaction does not change before and after adding perturbations, then the system is robust. If the satisfaction increases with perturbations, then the system is antifragile. Notice that and should be normalized to the interval , , respectively.

The perturbations for RBNs were defined in the previous section. We can define the “satisfaction” of a RBN based on its complexity. Since high complexity offers a balance between robustness and adaptability, we can arbitrarily prefer RBNs with high complexity. Using the complexity measure presented previously, is calculated by the following equation:where is complexity of a network before adding perturbations and is complexity of the network after adding perturbations. The same initial states are used at = 0. Because the value of complexity is between 0 and 1, -1 1.

Negative values of mean that the RBN is antifragile and positive values mean that the RBN is fragile. Values close to zero indicate that the RBN is robust. As shown in (4), has the opposite sign of . Hence, the negative values of indicate that is larger than (i.e., the complexity of a system is improved by external perturbations), while the positive values represent that is greater than (i.e., the complexity is lowered by the perturbations). The value of 0 refers to the fact that complexity does not change before and after perturbations, which indicates that the RBN is robust. Figures 1(a) and 1(b) show the values of calculated from the examples of critical and chaotic RBNs.

In a RBN, the value of can be different depending on initial states because is determined by the states of nodes. Thus, using multiple initial states, we calculate average for a RBN and represent it as a system property.

3. Experiments

We performed two sets of experiments: one for RBNs and the other for biological BNs.

First, to measure antifragility of RBNs, we generated ordered, critical, and chaotic RBNs composed of 100 nodes ( = 1 (ordered), 2 (critical), 3, 4, 5 (chaotic)) with internal homogeneity = 0.5 [31]. For each RBN, we randomly chose 10 different initial states and then examined their state transitions until simulation time = 200, respectively. For the same RBN taking the same initial states, varying perturbed node size and perturbation frequency , we obtained the state transitions of the perturbed RBN until = 200. By comparing complexity before and after perturbations, we calculated mean of antifragility for the 10 initial states. The measured values shown in the plots are average calculated from 50 different RBNs per .

Secondly, to measure antifragility of biological BNs, we used the following seven biological network models:(i)CD4+ T cell differentiation and plasticity [36] ( = 18). It is a model representing how CD4+ T cells orchestrate immune responses depending on environmental signals and immunological challenges.(ii)Mammalian cell-cycle [37] ( = 20). It is a model explaining the mechanism of action of the cell cycle checkpoints in mammalian cells.(iii)Cardiac development [38] ( = 15). It is a model referring to how the first heart field (FHF) and second heart field (SHF) are formed by differential expression of transcription and signaling factors during cardiac developmental processes.(iv)Metabolic interactions in the gut microbiome [39] ( = 12). It is a model describing interactive host-microbiota metabolic processes.(v)Death receptor signaling [40] ( = 28). It is a model related to the activation of death receptors (TNFR and Fas) that determine either survival or cell death.(vi)Arabidopsis thaliana cell-cycle [41] ( = 14). It is a model explaining the mechanism of plant cell-cycle and cell differentiation in A. thaliana.(vii)Tumor cell invasion and migration [42] ( = 32). It is a model representing the mechanism and interplays between pathways that are involved in the process of metastasis.

For each network, we randomly chose 1000 different initial states and then investigated their state transitions until = 200. Changing and , we computed antifragility. Specifications of parameters for the simulation follow Table 1. Our simulator for antifragility was implemented in Python (the source code is available at

Figure# of different networks# of initial states


4. Results and Discussion

4.1. Antifragility in RBNs

Figure 3 shows average of ordered ( = 1), critical ( = 2), and chaotic ( = 3, 4, 5) RBNs depending on perturbed node size and perturbation frequency . The ordered and critical RBNs had negative values (antifragility) in certain ranges of and , while the chaotic RBNs all had zero or positive values in the given ranges. This means that the ordered and critical RBNs can be antifragile if they have the “right” amount of perturbations. However, chaotic RBNs are just robust or fragile against perturbations.

As shown in Figure 3(a), the values of the ordered and critical RBNs were lower than zero and got smaller and smaller as increased, which indicates that their dynamics change more and more to antifragile. However, the values increased beyond certain values, and even the critical RBNs changed from antifragile to fragile (X > 20). From this, we found that neither too large nor too small, but a moderate level of perturbations can induce greater antifragility. These dynamics are similar to the slower-is-faster effect, where a moderate level of speed can lead to better traffic flow rather than that of the highest speed of individuals [43].

Meanwhile, in Figure 3(b), antifragility of the ordered and critical RBNs decreased overall as grew (i.e., the period of adding perturbations became longer and longer). Furthermore, all the RBNs were robust in the case of that the perturbations were not added frequently although the perturbed nodes were 40 ( = 40). From these results, we found that the more frequently perturbations are added, the more antifragile a system is, particularly for the ordered RBNs. Moreover, how often perturbations are added has a greater effect on antifragility than how many nodes are perturbed. Thus, it is essential that moderate perturbations are added frequently in order to obtain maximal antifragility.

Based on Figure 3, we are able to see that the ordered RBNs are the most antifragile. Figure 4 clearly accounts for the reason. In Figure 4(a), the complexity before adding perturbations was the lowest at = 1. However, as shown in Figure 4(b), the complexity after adding perturbations increased most greatly and the value was also the largest except for the early range of at = 1. Therefore, the difference was the largest at = 1 (Figure 4(c)), which led the ordered RBNs to be most antifragile.

Our result for complexity before perturbations is the same as previous studies showing that critical RBNs have the most appropriate balance between regularity and change [25, 28, 44]. In Figure 4(a), for low , the complexity was low, which represents that the ordered RBNs have high robustness and few changes. That is, there is few or no information emerging. For high , the complexity was also low, which reflects that the chaotic RBNs have high variability and many changes. Almost all the nodes carry novel emergent information. For medium connectivities (2 3), there was a balance between regularity and change, leading to high complexity. This is consistent with the dynamics of critical RBNs, where criticality is found theoretically at = 2 (when N∞) and for finite systems at 2 3 due to a finite-size effect [25].

However, the result is changed by adding perturbations. In Figure 4(b), the ordered RBNs had the biggest complexity excluding the early range of , which means that the ordered RBNs show the optimal balance between regularity and change in the presence of noise. This illustrates that systems can exhibit different properties in accordance with the presence of external stressors. Such phenomenon was recently observed in a neural network as well [45], where neural systems showed different dynamical behaviors depending on the presence/absence of external inputs.

4.2. Antifragility in Biological BNs

Boolean networks have been extensively used as models of genetic or cellular regulation in the fields of computational and systems biology [3642], because they can capture interesting features of biological systems despite their simplicity. Using seven biological Boolean network models, we measured the values of of biological systems.

We first consider a volatile environment where perturbations are added every time step ( = 1). Figure 5 shows that for this high level of noise, the network of A. thaliana cell-cycle is fragile, the networks of death receptor signaling and tumor cell invasion and migration are robust in a certain range of and fragile in the rest of the range, and the networks of CD4+ T cell differentiation and plasticity, mammalian cell-cycle, cardiac development, and metabolic interactions in the gut microbiome are antifragile against perturbations. When comparing with Figure 3(a), we found that antifragility of the biological networks except for A. thaliana cell-cycle is similar to that of ordered or critical RBNs.

To obtain more generalized dynamics, we investigated the probability of generating antifragile networks in a diverse range of and . Figure 6 is a heat map showing the probability for RBNs. As shown in the figure, the ordered and critical RBNs can produce antifragile networks. However, if too large perturbations are added in a volatile environment (i.e., = 1), both of them do not exhibit antifragile dynamics. In the case of the chaotic RBNs, they cannot produce antifragile networks in any range of and .

Figure 7 is a heat map for the seven BNs. They all show antifragile dynamics like the ordered or critical RBNs. Among the heat maps, the most interesting networks are A. thaliana cell-cycle and CD4+ T cell differentiation and plasticity. We found that A. thaliana cell-cycle repeatedly produces antifragile networks at regular intervals depending on the values of . Based on many studies demonstrating that living organisms are ordered or critical [4649], we can infer that A. thaliana might have been evolved in environments where particular dimensions of perturbations are added more frequently than other biological systems. We also found that CD4+ T cell differentiation and plasticity are the most antifragile of the ones studied, probably because it has the most variable environment. It indicates that our antifragility measure successfully captures the property of the immune system mentioned as a representative example of antifragile systems.

5. Conclusions

In this study, we proposed a new measure of (anti)fragility and applied it to RBNs. Considering an environment given to a system as a noise source, we observed how system properties can be varied depending on the degree of perturbations. We found that ordered and critical RBNs show antifragile dynamics, and especially ordered RBNs are most antifragile against the perturbations. Also, biological systems show antifragile dynamics.

In addition to the findings, we gained a meaningful insight to environments as external stressors. The high complexity with an optimal balance between regularity and change was acquired when moderate perturbations were added very frequently. It means that “optimality” depends on the precise variability of the environment. How can systems be antifragile or robust for varying levels of noise? Which mechanisms can be used to adjust the internal variability depending on the external variability? These questions demand further studies, but possible answers are already being explored based on the results presented here.

Based on the findings and insight, by adjusting the size and frequency of perturbations, we can control system properties from fragile through robust to antifragile dynamics. It may help to understand dynamical behaviors of biological systems depending on environmental conditions and develop new treatment strategies for various diseases including cancer or AIDS, e.g., how can we decrease the antifragility of cancer cells or pathogens? This should reduce their adaptability and potentially improve treatments.

Data Availability

Our simulator and data are available at

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.

Authors’ Contributions

Omar K. Pineda and Hyobin Kim contributed equally to this work.


We are grateful to Dario Alatorre, Ewan Colman, Luis Ángel Escobar, José Luis Mateos, Dante Pérez, and Fernanda Sánchez-Puig for useful comments and discussions. I would like to acknowledge Dr. Gershenson for his guidance during the MSc course of Adaptive Computation. The final work of the course served as a foundation for this paper [Omar K. Pineda]. This research was partially supported by CONACYT and DGAPA, UNAM.


  1. N. Taleb, Antifragile : Things That Gain from Disorder, Random House, New York, NY, USA, 2012.
  2. J. Derbyshire and G. Wright, “Preparing for the future: Development of an 'antifragile' methodology that complements scenario planning by omitting causation,” Technological Forecasting & Social Change, vol. 82, no. 1, pp. 215–225, 2014. View at: Publisher Site | Google Scholar
  3. T. Aven, “The concept of antifragility and its implications for the practice of risk analysis,” Risk Analysis, vol. 35, no. 3, pp. 476–483, 2015. View at: Publisher Site | Google Scholar
  4. A. Naji, M. Ghodrat, H. Komaie-Moghaddam, and R. Podgornik, “Asymmetric Coulomb fluids at randomly charged dielectric interfaces: Anti-fragility, overcharging and charge inversion,” The Journal of Chemical Physics, vol. 141, no. 17, article no. 174704, 2014. View at: Google Scholar
  5. M. Grube, L. Muggia, and C. Gostinčar, “Niches and adaptations of polyextremotolerant black fungi,” in Polyextremophiles, vol. 27, pp. 551–566, Springer, 2013. View at: Publisher Site | Google Scholar
  6. A. Danchin, P. M. Binder, and S. Noria, “Antifragility and tinkering in biology (and in business) flexibility provides an efficient epigenetic way to manage risk,” Gene, vol. 2, no. 4, pp. 998–1016, 2011. View at: Publisher Site | Google Scholar
  7. J. S. Levin, S. P. Brodfuehrer, and W. M. Kroshl, “Detecting antifragile decisions and models: Lessons from a conceptual analysis model of service life extension of aging vehicles,” in Proceedings of the 8th Annual IEEE International Systems Conference, SysCon 2014, pp. 285–292, Canada, April 2014. View at: Google Scholar
  8. R. Isted, “The use of antifragility heuristics in transport planning,” in Proceedings of Australian Institute of Traffic Planning and Management (AITPM) National Conference, vol. 3, 2014. View at: Google Scholar
  9. K. H. Jones, “Engineering antifragile systems: A change in design philosophy,” Procedia Computer Science, vol. 32, pp. 870–875, 2014. View at: Google Scholar
  10. M. Lichtman, M. T. Vondal, T. C. Clancy, and J. H. Reed, “Antifragile communications,” IEEE Systems Journal, vol. 12, no. 1, pp. 659–670, 2018. View at: Publisher Site | Google Scholar
  11. E. Verhulst, “Applying systems and safety engineering principles for antifragility,” Procedia Computer Science, vol. 32, pp. 842–849, 2014. View at: Google Scholar
  12. C. A. Ramirez and M. Itoh, “An initial approach towards the implementation of human error identification services for antifragile systems,” in Proceedings of the SICE Annual Conference (SICE), pp. 2031–2036, September 2014. View at: Google Scholar
  13. A. Abid, M. T. Khemakhem, S. Marzouk et al., “Toward antifragile cloud computing infrastructures,” Procedia Computer Science, vol. 32, pp. 850–855, 2014. View at: Google Scholar
  14. M. Monperrus, “Principles of antifragile software,” in Proceedings of Companion to the first International Conference on the Art, Science and Engineering of Programming, ACM, vol. 32, pp. 1–4, Brussels, Belgium, April 2017. View at: Publisher Site | Google Scholar
  15. L. Guang, E. Nigussie, J. Plosila, and H. Tenhunen, “Positioning antifragility for clouds on public infrastructures,” Procedia Computer Science, vol. 32, pp. 856–861, 2014. View at: Google Scholar
  16. R. Serra, M. Villani, A. Barbieri, S. A. Kauffman, and A. Colacci, “On the dynamics of random Boolean networks subject to noise: attractors, ergodic sets and cell types,” Journal of Theoretical Biology, vol. 265, no. 2, pp. 185–193, 2010. View at: Publisher Site | Google Scholar | MathSciNet
  17. A. L. Bauer, T. L. Jackson, Y. Jiang, and T. Rohlf, “Receptor cross-talk in angiogenesis: mapping environmental cues to cell phenotype using a stochastic, Boolean signaling network model,” Journal of Theoretical Biology, vol. 264, no. 3, pp. 838–846, 2010. View at: Publisher Site | Google Scholar
  18. M. K. Morris, J. Saez-Rodriguez, P. K. Sorger, and D. A. Lauffenburger, “Logic-based models for the analysis of cell signaling networks,” Biochemistry, vol. 49, no. 15, pp. 3216–3224, 2010. View at: Publisher Site | Google Scholar
  19. R. Albert and H. G. Othmer, “The topology of the regulatory interactions predicts the expression pattern of the segment polarity genes in Drosophila melanogaster,” Journal of Theoretical Biology, vol. 223, no. 1, pp. 1–18, 2003. View at: Publisher Site | Google Scholar | MathSciNet
  20. F. Li, T. Long, Y. Lu, Q. Ouyang, and C. Tang, “The yeast cell-cycle network is robustly designed,” Proceedings of the National Acadamy of Sciences of the United States of America, vol. 101, no. 14, pp. 4781–4786, 2004. View at: Publisher Site | Google Scholar
  21. M. Paczuski, K. E. Bassler, and Á. Corral, “Self-organized networks of competing boolean agents,” Physical Review Letters, vol. 84, no. 14, pp. 3185–3188, 2000. View at: Publisher Site | Google Scholar
  22. M. E. J. Newman, “Spread of epidemic disease on networks,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 66, no. 1, Article ID 016128, 11 pages, 2002. View at: Publisher Site | Google Scholar
  23. P. Rämö, S. A. Kauffman, J. Kesseli, and O. Yli-Harja, “Measures for information propagation in Boolean networks,” Physica D: Nonlinear Phenomena, vol. 227, no. 1, pp. 100–104, 2007. View at: Publisher Site | Google Scholar | MathSciNet
  24. A. Roli, M. Manfroni, C. Pinciroli, and M. Birattari, “On the design of Boolean network robots,” in Proceedings of the European Conference on the Applications of Evolutionary Computation, pp. 43–52, Springer, 2011. View at: Google Scholar
  25. N. Fernández, C. Maldonado, and C. Gershenson, “Information measures of complexity, emergence, self-organization, homeostasis, and autopoiesis,” in Guided Self-Organization: Inception, M. Prokopenko, Ed., vol. 9, pp. 19–51, Springer, 2014. View at: Publisher Site | Google Scholar
  26. S. A. Kauffman, “Metabolic stability and epigenesis in randomly constructed genetic nets,” Journal of Theoretical Biology, vol. 22, no. 3, pp. 437–467, 1969. View at: Publisher Site | Google Scholar
  27. S. A. Kauffman, The Origins of Order Self-Organization and Selection in Evolution, Oxford University Press, 1993.
  28. C. Gershenson, “Introduction to random Boolean networks,” in Proceedings of the Ninth International Conference on the Simulation and Synthesis of Living Systems (ALife IX), pp. 160–173, 2004. View at: Google Scholar
  29. C. Gershenson and N. Fernández, “Complexity and information: Measuring emergence, self-organization, and homeostasis at multiple scales,” Complexity, vol. 18, no. 2, pp. 29–44, 2012. View at: Publisher Site | Google Scholar
  30. C. C. Walker and W. R. Ashby, “On temporal characteristics of behavior in certain complex systems,” Kybernetik, vol. 3, no. 2, pp. 100–108, 1966. View at: Publisher Site | Google Scholar
  31. B. Derrida and Y. Pomeau, “Random networks of automata: A simple annealed approximation,” EPL (Europhysics Letters), vol. 1, no. 2, pp. 45–49, 1986. View at: Publisher Site | Google Scholar
  32. C. Gershenson, “Guiding the self-organization of random Boolean networks,” Theory in Biosciences, vol. 131, no. 3, pp. 181–191, 2012. View at: Publisher Site | Google Scholar
  33. C. G. Langton, “Computation at the edge of chaos: phase transitions and emergent computation,” Physica D: Nonlinear Phenomena, vol. 42, no. 1–3, pp. 12–37, 1990. View at: Publisher Site | Google Scholar
  34. R. López-Ruiz, H. L. Mancini, and X. Calbet, “A statistical measure of complexity,” Physics Letters A, vol. 209, no. 5-6, pp. 321–326, 1995. View at: Publisher Site | Google Scholar
  35. C. Gershenson, “The sigma profile: A formal tool to study organization and its evolution at multiple scales,” Complexity, vol. 16, no. 5, pp. 37–44, 2011. View at: Publisher Site | Google Scholar
  36. M. E. Martinez-Sanchez, L. Mendoza, C. Villarreal, and E. R. Alvarez-Buylla, “A Minimal regulatory network of extrinsic and intrinsic factors recovers observed patterns of CD4+ T cell differentiation and plasticity,” PLoS Computational Biology, vol. 11, no. 6, article no. 1004324, 2015. View at: Google Scholar
  37. Ö. Sahin, H. Fröhlich, C. Löbke et al., “Modeling ERBB receptor-regulated G1/S transition to find novel targets for de novo trastuzumab resistance,” BMC Systems Biology, vol. 3, no. 1, 2009. View at: Google Scholar
  38. F. Herrmann, A. Groß, D. Zhou, H. A. Kestler, and M. Kühl, “A Boolean model of the cardiac gene regulatory network determining first and second heart field identity,” PLoS ONE, vol. 7, no. 10, article no. 46798, 2012. View at: Google Scholar
  39. S. N. Steinway, M. B. Biggs, T. P. Loughran, J. A. Papin, and R. Albert, “Inference of network dynamics and metabolic interactions in the gut microbiome,” PLoS Computational Biology, vol. 11, no. 6, article no. 1004338, 2015. View at: Google Scholar
  40. L. Calzone, L. Tournier, S. Fourquet et al., “Mathematical modelling of cell-fate decision in response to death receptor engagement,” PLoS Computational Biology, vol. 6, no. 3, article no. 1000702, 2010. View at: Publisher Site | Google Scholar | MathSciNet
  41. E. Ortiz-Gutiérrez, K. García-Cruz, E. Azpeitia et al., “A dynamic gene regulatory network model that recovers the cyclic behavior of arabidopsis thaliana cell cycle,” PLoS Computational Biology, vol. 11, no. 9, article no. e1004486, 2015. View at: Publisher Site | Google Scholar
  42. D. P. Cohen, L. Martignetti, S. Robine et al., “Mathematical modelling of molecular pathways enabling tumour cell invasion and migration,” PLoS Computational Biology, vol. 11, no. 11, article no. e1004571, 2015. View at: Publisher Site | Google Scholar
  43. C. Gershenson and D. Helbing, “When slower is faster,” Complexity, vol. 21, no. 2, pp. 9–15, 2015. View at: Publisher Site | Google Scholar
  44. S. A. Kauffman, Investigations, Oxford University Press, 2000.
  45. J. Schuecker, S. Goedeke, and M. Helias, “Optimal sequence memory in driven random networks,” Physical Review X, vol. 8, no. 4, Article ID 041029, 2018. View at: Publisher Site | Google Scholar
  46. I. Shmulevich, S. A. Kauffman, and M. Aldana, “Eukaryotic cells are dynamically ordered or critical but not chaotic,” Proceedings of the National Acadamy of Sciences of the United States of America, vol. 102, no. 38, pp. 13439–13444, 2005. View at: Publisher Site | Google Scholar
  47. E. Balleza, E. R. Alvarez-Buylla, A. Chaos, S. Kauffman, I. Shmulevich, and M. Aldana, “Critical dynamics in genetic regulatory networks: Examples from four kingdoms,” PLoS ONE, vol. 3, no. 6, article no. 2456, 2008. View at: Google Scholar
  48. M. Villani, L. La Rocca, S. A. Kauffman, and R. Serra, “Dynamical criticality in gene regulatory networks,” Complexity, vol. 2018, Article ID 5980636, 14 pages, 2018. View at: Publisher Site | Google Scholar
  49. B. C. Daniels, H. Kim, D. Moore et al., “Criticality distinguishes the ensemble of biological regulatory networks,” Physical Review Letters, vol. 121, no. 13, article no. 138102, 2018. View at: Publisher Site | Google Scholar

Copyright © 2019 Omar K. Pineda et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Related articles

No related content is available yet for this article.
 PDF Download Citation Citation
 Download other formatsMore
 Order printed copiesOrder

Related articles

No related content is available yet for this article.

Article of the Year Award: Outstanding research contributions of 2020, as selected by our Chief Editors. Read the winning articles.