Kauffman networks with threshold functions

Simple item page
dc.creatorGreil, Florian
dc.creatorDrossel, Barbara
dc.date2007-01-09
dc.date.accessioned2026-07-07T08:17:40Z
dc.date.available2026-07-07T08:17:40Z
dc.descriptionWe 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 results are supported by analytical calculations and computer simulations.
dc.description4 pages, submitted to PhysRev; http://www.edpsciences.org/10.1140/epjb/e2007-00161-0
dc.identifierhttps://arxiv.org/abs/cond-mat/0701176
dc.identifierhttp://arxiv.org/abs/cond-mat/0701176
dc.identifierEur. Phys. J. B 57, 109-113 (2007)
dc.identifierdoi:10.1140/epjb/e2007-00161-0
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134171
dc.subjectDisordered Systems and Neural Networks
dc.subjectStatistical Mechanics
dc.titleKauffman networks with threshold functions
dc.typetext

Files

Collections

arXiv