Critical Values in Asynchronous Random Boolean Networks
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.
KeywordsBoolean Function Cellular Automaton Cellular Automaton Input Node Boolean Network
Unable to display preview. Download preview PDF.
- 1.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)Google Scholar
- 3.Ashby, W.R.: Design for a Brain. Wiley, New York (1956)Google Scholar
- 4.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)Google Scholar
- 7.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)Google Scholar
- 9.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)Google Scholar
- 10.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)Google Scholar
- 13.Kauffman, S.A.: The Origins of Order: Self–Organization and Selection in Evolution. Oxford University Press, Oxford (1993)Google Scholar
- 16.Rozonoér, L.I.: Random logical nets I. Automation and Remote Control 5, 773–781 (1969); Translation of Avtomatika i TelemekhanikaGoogle Scholar
- 21.Teuscher, C.: Turing’s Connectionism. In: An Investigation of Neural Network Architectures, September 2001. Springer, London (2001)Google Scholar
- 22.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)Google Scholar