Kauffman networks with threshold functions

F. Greil () and B. Drossel

The European Physical Journal B: Condensed Matter and Complex Systems, 2007, vol. 57, issue 1, 109-113

Abstract: 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. Copyright EDP Sciences/Società Italiana di Fisica/Springer-Verlag 2007

Keywords: 89.75.Hc Networks and genealogical trees; 05.70.Fh Phase transitions: general studies; 05.65.+b Self-organized systems (search for similar items in EconPapers)
Date: 2007
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1140/epjb/e2007-00161-0 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:eurphb:v:57:y:2007:i:1:p:109-113

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/10051

DOI: 10.1140/epjb/e2007-00161-0

Access Statistics for this article

The European Physical Journal B: Condensed Matter and Complex Systems is currently edited by P. Hänggi and Angel Rubio

More articles in The European Physical Journal B: Condensed Matter and Complex Systems from Springer, EDP Sciences
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().