Kauffman networks with threshold functions
- 63 Downloads
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
Unable to display preview. Download preview PDF.
- J.M. Alexander, in Philosophy of Science Assoc. 18th Biennial Mtg. December 10th, 2002 Google Scholar
- M. Aldana-Gonzalez, S. Coppersmith, L.P. Kadanoff, Perspectives and Problems in Nonlinear Science (2003), pp. 23–89, e-print arXiv:nlin.AO/0204062 Google Scholar
- M. Andrecut, J. Stat. Mech. 2, P02003 (2005) Google Scholar
- J. Kesseli, P. Rämö, O. Yli-Harja, Phys. Rev. E 046104 (2006) Google Scholar