Kauffman networks with threshold functions
Institut für Festkörperphysik, Technische Universität Darmstadt, Hochschulstraße 6, 64289 Darmstadt, Germany
Corresponding author: a email@example.com
Revised: 24 April 2007
Published online: 1 June 2007
We investigate Threshold Random Boolean Networks with K = 2 inputs per node, which are equivalent to Kauffman networks, with only part of the canalyzing functions as update functions. According to the simplest consideration these networks should be critical but it turns out that they show a rich variety of behaviors, including periodic and chaotic oscillations. The analytical results are supported by computer simulations.
PACS: 89.75.Hc – Networks and genealogical trees / 05.70.Fh – Phase transitions: general studies / 05.65.+b – Self-organized systems
© EDP Sciences, Società Italiana di Fisica, Springer-Verlag, 2007