Abstract
Wherever we see life, we see different kinds of complex networks, reason why they are studied across various fields of science. Random Boolean Networks (RBNs) form a special class in which the links between the nodes and the boolean functions are specified at random. Whereas synchronous RBNs were investigated in detail, there has little been done around their asynchronous counterpart, although there is evidence that most living systems are governed by asynchronous updating. Derrida’s annealed approximation predicts a critical connectivity value of K=2 for synchronous RBNs. We present a similar and original approach for asynchronous RBNs and show that they do not possess such a critical connectivity value. The asynchronous and nondeterministic updating scheme introduces perturbations that reach about 25% of the nodes and thus prevents the networks to become stable. Further, our numerical simulations show that asynchronous RBN tend to amplify small and to reduce big perturbations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Allanson, J.T.: Some properties of randomly connected neural nets. In: Cherry, C. (ed.) Proceedings of the 3rd London Symposium on Information Theory, Butterworths, London, pp. 303–313 (1956)
Amari, S.I.: Characteristics of randomly connected threshold-element networks and network systems. Proceedings of the IEEE 59(1), 35–47 (1971)
Ashby, W.R.: Design for a Brain. Wiley, New York (1956)
Bersini, H., Detours, V.: Asynchrony induces stability in cellular automata based models. In: Brooks, R.A., Maes, P. (eds.) Proceedings of the Artificial Life IV conference, pp. 382–387. MIT Press, Cambridge (1994)
Capcarrere, M.S.: Evolution of asynchronous cellular automata. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 903–912. Springer, Heidelberg (2002)
Derrida, B., Pomeau, Y.: Random networks of automata: A simple annealed approximation. Europhysics Letters 1(2), 45–49 (1986)
Gershenson, C.: Classification of random boolean networks. In: Standish, R.K., Bedau, M.A., Abbass, H.A. (eds.) Proceedings of the Eight International Conference on Artificial Life, Artificial Life VIII. Complex Adaptive Systems Series, pp. 1–8. A Bradford Book, MIT Press (2003)
Glass, L., Mackey, M.C.: From Clocks to Chaos: The Rhythms of Life. Princeton University Press, Princeton (1988)
Harvey, I., Bossomaier, T.: Time out of joint: Attractors in asynchronous random boolean networks. In: Husbands, P., Harvey, I. (eds.) Proceedings of the Fourth European Conference on Artificial Life, pp. 67–75. MIT Press, Cambridge (1997)
Hopfield, J.J.: Neural networks and physical systems with emergent collective computational abilities. In: Proceedings of the National Academy of Sciences of the United States of America (PNAS), April 1982, vol. 79, pp. 2554–2558 (1982)
Hurford, J.R.: Random boolean nets and features of language. IEEE Transactions on Evolutionary Computation 5(2), 111–116 (2001)
Kauffman, S.A.: Metabolic stability and epigenesis in randomly connected genetic nets. Journal of Theoretical Biology 22, 437–467 (1968)
Kauffman, S.A.: The Origins of Order: Self–Organization and Selection in Evolution. Oxford University Press, Oxford (1993)
Milo, R., She-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: Simple building blocks of complex networks. Science 298, 824–827 (2002)
Di Paolo, E.A.: Rhythmic and non-rhythmic attractors in asynchronous random boolean networks. Biosystems 59(3), 185–195 (2001)
Rozonoér, L.I.: Random logical nets I. Automation and Remote Control 5, 773–781 (1969); Translation of Avtomatika i Telemekhanika
Schönfisch, B., de Roos, A.: Synchronous and asynchronous updating in cellular automata. BioSystems 51(3), 123–143 (1999)
Sporns, O., Tononi, G.: Classes of network connectivity and dynamics. Complexity 7(1), 28–38 (2002)
Stark, W.R., Hughes, W.H.: Asynchronous, irregular automata nets: The path not taken. BioSystems 55(1-3), 107–117 (2000)
Strogatz, S.H.: Exploring complex networks. Nature 410, 268–276 (2001)
Teuscher, C.: Turing’s Connectionism. In: An Investigation of Neural Network Architectures, September 2001. Springer, London (2001)
Weisbuch, G.: Complex Systems Dynamics: An Introduction to Automata Networks. Lecture Notes, Santa Fe Institute, Studies in the Sciences of Complexity, vol. 2. Addison-Wesley, Redwood City (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mesot, B., Teuscher, C. (2003). Critical Values in Asynchronous Random Boolean Networks. In: Banzhaf, W., Ziegler, J., Christaller, T., Dittrich, P., Kim, J.T. (eds) Advances in Artificial Life. ECAL 2003. Lecture Notes in Computer Science(), vol 2801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39432-7_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-39432-7_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20057-4
Online ISBN: 978-3-540-39432-7
eBook Packages: Springer Book Archive